9:30 a.m. Domination Dot-Critical Graphs. David P Sumner*, University of South Carolina
Tamara A Burton, University of South Carolina
(963-05-231)
10:00 a.m. Grundy and Parsimoneous Proper Colorings of Graphs. S T Hedetniemi, Clemson University
R. C. Laskar*, Clemson University
(963-05-111)
10:30 a.m. A distance-degree condition and non-separating paths. Stephen C Locke*, Florida Atlantic University
H.-J. Voss, Technical University Dresden
(963-05-241)
11:00 a.m. Shattering News. Richard P Anstee, University of British Columbia
Lajos Ronyai, Computer and Automation Institute, Hungarian
Attila Sali*, Department of Computer Science, Indiana University-Purdue University at Fort Wayne
(963-05-240)
11:30 a.m. Equitable colorings of outerplanar graphs. Alexandr V Kostochka*, University of Illinois at Urbana-Champaign
(963-05-118)
4:00 p.m. Graph Minors and Reliable Single Message Transmission. Andre Kundgen*, California State University, San Marcos
Faith E Fich, University of Toronto
Mike Pelsmajer, University of Illinois
Radhika Ramamurthi, University of Illinois
(963-05-191)
4:30 p.m. Density of Integral Sets with Missing Differences. Daphne Der-Fen Liu*, California State University, Los Angeles
Xuding Zhu, National Sun Yat-sen University, Taiwan
(963-05-187)
5:00 p.m. Graph Partitions. Pavol Hell*, Simon Fraser University
(963-05-147)
9:30 a.m. Generalized sum-free sets in abelian groups and constructions of spherical designs. B\'{e}la Bajnok*, Gettysburg College
(963-05-92)
10:00 a.m. On the Erd\H{o}s-Simonovits-S\'os Conjecture about the anti-Ramsey numbers of cycles. Tao Jiang, Michigan Technological University
Douglas B West*, University of Illinois
(963-05-137)
10:30 a.m. New types of coding problems. Gyula O.H. Katona*, R\'enyi Institute
(963-05-234)
3:00 p.m. 40\% of a conjecture of F\"{u}redi on chain partitions of the Boolean lattice. Timothy M Hsu, Pomona College
Mark Logan, Claremont McKenna College
Shahriar Shahriari*, Pomona College
Christopher Towse, Scripps College
(963-05-58)
3:30 p.m. Polynomial LYM--inequalities. Christian Bey*, University of Rostock, Germany
(963-05-194)
4:00 p.m. Some New Results on Isoperimetric-Type Problems. Sergei L Bezrukov*, University of Wisconsin - Superior
(963-05-78)
4:30 p.m. Circular Permutations with Low Discrepancy Consecutive $k$-sums. Richard P Anstee*, U.B.C., Canada
Ron Ferguson, U.B.C., Canada
Jerrold R Griggs, University of South Carolina
(963-05-164)
5:00 p.m. Meet and join within the lattice of set partitions. Rod Canfield*, University of Georgia
(963-05-131)
9:30 a.m. Protein structure matching --- an extension of the largest clique size in Erd\H os-R\'enyi random graphs. \'Eva Czabarka*, National Institutes of Health, National Library of Medicine, National Center for Biotechnology Information
Stephen H Bryant, National Institutes of Health, National Library of Medicine, National Center for Biotechnology Information
Tom Madej, National Institutes of Health, National Library of Medicine, National Center for Biotechnology Information
John L Spouge, National Institutes of Health, National Library of Medicine, National Center for Biotechnology Information
(963-05-172)
10:00 a.m. How many disjoint 2-edge paths must a cubic graph have? Dhruv Mubayi*, Georgia Tech
Alexander Kelmans, University of Peurto Rico and Rutgers University
(963-05-152)
10:30 a.m. Diregularity of digraphs close to Moore bound. Mirka Miller*, University of Newcastle
(963-05-245)
11:00 a.m. Break
11:30 a.m. Long cycles through specified edgesin $k$-connected graphs. Tristan M Denley*, University of Mississippi
Haidong Wu, University of Mississippi
(963-05-195)
12:00 p.m. Edge list multicoloring trees: An extension of Hall's theorem. Matthew Cropper, Eastern Kentucky University
Andras Gyarfas, Hungarian Academy of Sciences
Jeno Lehel*, University of Louisville
(963-05-247)
