On a bottleneck bipartition conjecture of Erdös. - Thomas Dale Porter (Comb., 1992)

Single change neighbor designs. - Robert L. Constable; Donald A. Preece; Nicholas C. K. Phillips; Thomas Dale Porter; Walter D. Wallis (Australas. J Comb., 1995)

On the Maximum Number of Chords in a Cycle of a Graph. - Lane H. Clark; Thomas Dale Porter (Ars Comb., 1997)

Minimal Partitions of a Graph. - Thomas Dale Porter (Ars Comb., 1999)

A hierarchy of self-clique graphs. - Francisco Larrión; Victor Neumann-Lara; Miguel A. Pizaña; Thomas Dale Porter (Discret. Math., 2004)

Generating sequences of clique-symmetric graphs via Eulerian digraphs. - John P. McSorley; Thomas Dale Porter (Discret. Math., 2004)

Closed-neighbourhood anti-Sperner graphs. - John P. McSorley; Alison Marr; Thomas Dale Porter; Walter D. Wallis (Australas. J Comb., 2007)

Binomial Identities Generated by Counting Spanning Trees. - Thomas Dale Porter (Ars Comb., 2007)