8:00 a.m. The Relaxed Game Chromatic Number of Graphs. Charles Dunn, Arizona State University
H. A Kierstead*, Arizona State University
(973-05-1194)
8:30 a.m. The Relaxed Game Chromatic Index of $k$-degenerate Graphs. Charles L Dunn*, Arizona State University
(973-05-175)
9:00 a.m. Splittable colorings. Radhika Ramamurthi*, University of California at San Diego
Zoltan Furedi, University of Illinois / Renyi Institute
Andre Kundgen, California State University at San Marcos
(973-05-1057)
9:30 a.m. On Anti-Ramsey numbers of graphs. Maria Axenovich*, Iowa State University
(973-05-892)
10:00 a.m. Constrained Ramsey numbers of graphs. Tao Jiang*, Miami University (Ohio)
(973-05-859)
10:30 a.m. Pattern Ramsey Numbers. Robert E Jamison, Clemson University
Douglas B West*, University of Illinois
(973-05-1236)
2:15 p.m. Coloring graphs on nonorientable versus orientable surfaces. Joan P Hutchinson*, Macalester College
Michael O Albertson, Smith College
(973-05-813)
2:45 p.m. Graph Color Extensions: When Embedding Helps. Michael O Albertson*, Smith College
Joan P Hutchinson, Macalester College
(973-05-753)
3:15 p.m. Graphs minimal with respect to crossing number $k$. Bruce Richter*, University of Waterloo
(973-05-1426)
3:45 p.m. Algebraic Criterion for imbedding graphs in Projective plane. Daniel C Slilaty*, Wright State University
Lowell Abrams, The George Washington University
(973-05-1076)
4:15 p.m. Equitably $k$-Choosable Graphs. Michael J Pelsmajer*, University of Illinois at Urbana-Champaign
Alexandr V Kostochka, University of Illinois at Urbana-Champaign
Douglas B West, University of Illinois at Urbana-Champaign
(973-05-1205)
4:45 p.m. An Upper Bound for Representations of Graphs Modulo $n$. Darren A. Narayan*, Rochester Institute of Technology
(973-05-159)
5:15 p.m. Sum List Coloring Problems. Garth T Isaak*, Lehigh University
(973-05-872)
5:45 p.m. Colored and chromatic distance in graphs. Peter J Slater*, University of Alabama at Huntsville
(973-05-1182)
8:00 a.m. Green's functions, hitting times, and chip-firing games. Fan Chung, University of California at San Diego
Robert B. Ellis, III*, University of California at San Diego
(973-05-1212)
8:30 a.m. Independence Ratios and Matching Ratios. Christopher C Heckman*, Arizona State University
(973-05-140)
9:00 a.m. Some results about integer flows. C. Q. Zhang*, West Virginia University
(973-05-433)
9:30 a.m. Binary Gray Codes with Long Bit Runs. Luis A. Goddyn*, Simon Fraser University
Pavol Gvozdjak, Simon Fraser University
(973-05-855)
10:00 a.m. Split Graphs. Russell L Merris*, California State University, Hayward
(973-05-951)
10:30 a.m. Intersecting Families with Minimum Volume. Jerrold R Griggs*, University of South Carolina
(973-05-893)
11:00 a.m. Kneser graphs are Hamiltonian for $n > 2.62 k$. Ya-chen Chen*, Arizona State University
(973-05-1185)
11:30 a.m. Interval Orders, Graph Coloring, Hamiltonian Paths and $\alpha$-Sequences: Part 2. William T Trotter*, Arizona State University
(973-05-1446)