Thomas Porter

SIUC, Mathematics

Professor
 
Ph.D. University of New Mexico, 1990
 
Combinatorics and Graph Theory
 
Office: Neckers A 469
Office Phone: 618-453-6507
Email: tporter at math.siu.edu
Web Page: http://www.math.siu.edu/porter
Home Page: http://www.math.siu.edu/porter/PO-Publications.html

Research Interests

Combinatorics and Graph Theory

Selected Publications

  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. On a Bottleneck Bipartition Conjecture of Erdös, Combinatorica, 3 (1992), 317-321.
  5. Cycle-Saturated Graphs of Minimum Size, (with C. Barefoot, L. Clark, R. Entringer, L. Székely, Zs. Tuza), Discrete Mathematics, 150 (1996), 31-48.


Comments: Webmaster

Copyright © 2005, Board of Trustees, Southern Illinois University
Privacy Policy Last Updated