Thomas Dale Porter

According to our database, Thomas Dale Porter authored at least 8 papers between 1992 and 2007.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2007

Binomial Identities Generated by Counting Spanning Trees.

Thomas Dale Porter

Ars Comb., 2007

Closed-neighbourhood anti-Sperner graphs.

John P. McSorley, Alison Marr, Thomas Dale Porter, Walter D. Wallis

Australas. J Comb., 2007

2004

Generating sequences of clique-symmetric graphs via Eulerian digraphs.

John P. McSorley, Thomas Dale Porter

Discret. Math., 2004

A hierarchy of self-clique graphs.

Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña, Thomas Dale Porter

Discret. Math., 2004

1999

Minimal Partitions of a Graph.

Thomas Dale Porter

Ars Comb., 1999

1997

On the Maximum Number of Chords in a Cycle of a Graph.

Lane H. Clark, Thomas Dale Porter

Ars Comb., 1997

1995

Single change neighbor designs.

Robert L. Constable, Donald A. Preece, Nicholas C. K. Phillips, Thomas Dale Porter, Walter D. Wallis

Australas. J Comb., 1995

1992

On a bottleneck bipartition conjecture of Erdös.

Thomas Dale Porter

Comb., 1992