1:45 p.m. Enumeration of highly irregular trees by automorphism group order. Kathleen A. McKeon*, Connecticut College
(860-05-101)
2:15 p.m. On self-complementary graphs. M. S. Krishnamoorthy*, Rensselaer Polytechnic Institute
M. McMenamin, Rensselaer Polytechnic Institute
(860-05-85)
2:45 p.m. Stable sets, max-cuts and quadratic 0-1 optimization. Jean-Marie Bourjolly*, Concordia University
(860-49-118)
8:00 a.m. Planar posets are lexicographically shellable. Karen L. Collins*, Wesleyan University
(860-05-29)
8:40 a.m. Discussion
9:20 a.m. A degree condition for Hamiltonian cycles in t-tough graphs with t>1. Douglas Bauer*, Stevens Institute of Technology
Lewis L. Lasser, Stevens Institute of Technology
Guantao Chen, Memphis State University
(860-05-30)