PDF files may be viewed from links below.
1. A Hierarchy of Self-Clique Graphs, (with F. Larrión, V. Neumann-Lara, M.A. Pizaña), Discrete Mathematics 282 (2004) 193-208.
2. Generating Sequences of Clique Symmetric Graphs via Eulerian Digraphs, (with J.P. McSorley), Discrete Mathematics 287 (2004), 85--91.
3. Generating the List of Spanning Trees in Ks,t, Journal of Combinatorial Mathematics and Combinatorial Computing, 50 (2004), 17-32.
4. Graphs with the Anti-Neighborhood-Sperner Property, Journal of Combinatorial Mathematics and Combinatorial Computing, 50(2004), 123-127.
5. Recognizing Self-Clique Graphs, (with F. Larrión, V. Neumann-Lara, M.A. Pizaña), Matematica Contemporanea, 25 (2003), 125-133.
6. Clique-Symmetric Uniform Hypergraphs, (with J.P. McSorley), Matematica Contemporanea 25 (2003), 145-152.
7. Kp-Removable Sequences of Graphs, (with J.P. McSorley), Journal of Combinatorial Mathematics and Combinatorial Computing, 45 (2003), 43-62.
8. Self-Clique Graphs with Prescribed Clique-Sizes, (with F. Larrión, V. Neumann-Lara, M.A. Pizaña), Congressus Numerantium, 157 (2002), 173-182.
9. Characterizing Balanced Bipartite Graphs with Part-Switching Automorphisms, (with J.C. George and W.D. Wallis), Bulletin of the ICA, Volume 28 (2000), 85-88.
10. On a Bottleneck Bipartition Conjecture of Erdös, Combinatorica, 3 (1992), 317-321.
11. A New Proof of Cayley’s Theorem, (with L.H. Clark), (in pareparation).
12. The Non-Isomorphic Spanning Trees in the Hypercube, (in preparation).
13. Binomial Identities Generated by Counting Spanning Trees, (submitted to Ars Combinatoria).
14. Graphs Whose Vertex-Neighborhoods are Non-Sperner, (with J.L. Yucas), to appear in Bulletin of the Inst. of Comb. and its Appl.
15. Graph Partitions II, (with Bing Yang), JCMCC, 37 (2001), 149-158.
16. Minimal Partitions of a Graph, Ars Combinatoria, 53 (1999), pp. 181-186.
17. A Bound Involving the Centroid and Wiener Index of a Tree, Utilitas Mathematica, 53 (1998), 141-146.
18. On the Number of I-Factors in the n-Cube, (with L.H. Clark and J.C. George), Congressus Numerantium, 127 (1997), 67-69.
19. "On the Maximum Number of Chords in a Cycle of a Graph, (with L.H. Clark), Ars Combinatoria, 46 (1997), 129-132.
20. Cycle-Saturated Graphs of Minimum Size, (with C. Barefoot, L. Clark, R. Entringer, L. Székely, Zs. Tuza), Discrete Mathematics, 150 (1996), 31-48.
21. Single Change Neighbor Designs, (with R. Constable, N. Phillips, D. Preece, W. Wallis), Australasian Journal of Combinatorics, 11 (1995), 247-255.
22. Graph Partitions, The Journal of Combinatorial Mathematics and Combinatorial Computing, 15 (1994), 111-118.
23. On a Matrix Discrepancy Problem, (with László Székely), Congressus Numerantium, 73 (1990), 239-248.
24. Generating Functions for a Problem of Riordan, (with László Székely), The Journal of Combinatorial Mathematics and Combinatorial Computing, 6 (1989), 195-198.
T. Porter Home Page: http://www.math.siu.edu/porter/
Department of Mathematics home page: http://www.math.siu.edu/