Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Porter, Thomas - Department of Mathematics, Southern Illinois University
Graph Partitions II Thom Porter
Applications of Chromatic Polynomials Involving Stirling
Binomial Identities Generated by Counting Spanning Trees
Characterizing Balanced Bipartite Graphs With Part-Switching
A BOUND INVOLVING THE CENTROID AND WIENER INDEX OF A TREE
Graphs whose Vertex-Neighborhoods are Anti-Sperner
Kp-Removable Sequences of Graphs John P. McSorley
Some Applications of Spanning Trees in Ks,t L.H. Clark, A.T. Mohr, and T.D. Porter
Generating Clique-Symmetric Graphs Via Eulerian Digraphs
Generating the List of Spanning Trees in Ks,t
Graphs with the Anti-Neighborhood-Sperner Property
Clique-Symmetric Uniform Hypergraphs John P. McSorley
SELF-CLIQUE GRAPHS WITH PRESCRIBED CLIQUE-SIZES
Minimal Partitions of a Graph Thomas Dale Porter1
