| |
| 2007 | ||
|---|---|---|
| 6 | Thomas Dale Porter: Binomial Identities Generated by Counting Spanning Trees. Ars Comb. 82: (2007) | |
| 2004 | ||
| 5 | EE | Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña, Thomas Dale Porter: A hierarchy of self-clique graphs. Discrete Mathematics 282(1-3): 193-208 (2004) |
| 4 | EE | John P. McSorley, Thomas Dale Porter: Generating sequences of clique-symmetric graphs via Eulerian digraphs. Discrete Mathematics 287(1-3): 85-91 (2004) |
| 1999 | ||
| 3 | Thomas Dale Porter: Minimal Partitions of a Graph. Ars Comb. 53: (1999) | |
| 1997 | ||
| 2 | Lane H. Clark, Thomas Dale Porter: On the Maximum Number of Chords in a Cycle of a Graph. Ars Comb. 46: (1997) | |
| 1992 | ||
| 1 | Thomas Dale Porter: On a bottleneck bipartition conjecture of Erdös. Combinatorica 12(3): 317-321 (1992) | |
| 1 | Lane H. Clark | [2] |
| 2 | Francisco Larrión | [5] |
| 3 | John P. McSorley | [4] |
| 4 | Victor Neumann-Lara | [5] |
| 5 | Miguel A. Pizaña | [5] |