Special Session in Graph Theory - Schedule of Talks

All talks last 20 minutes

AMS has scheduled plenary speakers at 11AM and 1:30PM on Friday and Saturday

Friday morning, 9-11AM

9:00 - M. Ellingham (Vanderbilt), The spectral radius of graphs on surfaces
9:30 - X. Zha (Middle Tennessee State), Genus lower bounds for embeddings w large connectivity and representativity
10:00 - J. Hutchinson (Macalester), On some extensions of bar-visibility graphs
10:30 - N. Robertson (Ohio State), Recent Research on Digraph Minors

Friday afternoon, 3-6PM

3:00 - M.S. Jacobson (Louisville), Hamiltonian graphs with 2-factors having two components
3:30 - R. Faudree (Memphis), Two-Factors Containing Specified Edges
4:00 - R. Gould (Emory), Graph connectivity after path removal
4:30 - L. Goddyn (Simon Fraser), The computation of and relationships among graph invariants
5:00 - L. Thoma (Carnegie Mellon), On Dependent Arcs in Acyclic Orientations and Cover Graphs.
5:30 - A. Kostochka (Novosibirsk and Memphis), Nice graphs and their generalizations

Saturday morning, 9-11AM

9:00 - A.E. Kezdy (Louisville), A generalization of Fisher's Inequality
9:30 - T.A. Mckee (Wright State), Strengthening Distance-Hereditary Graphs
10:00 - D. Mubayi (Georgia Tech), Generalizing the Ramsey problem through Diameter
10:30 - R. Schelp (Memphis), Edge-Maximal Triangle-Free Point-Determining Graphs

Saturday afternoon, 3-6PM

3:00 - H.A. Kierstead (Arizona State), Game coloring number
3:30 - W.T. Trotter (Arizona State), Dimension, Graph and Hypergraph Coloring
4:00 - M. Krivelevich (Institute for Advanced Study), Testing bipartiteness efficiently
4:30 - D. Corneil (Toronto), On the Power of Lexicographic Breadth First Search
5:00 - J. Spinrad (Vanderbilt), New Algorithms for Weakly Chordal Graphs
5:30 - Z. Miller (Miami - Ohio)), Improved dilation bounds for embedding k-dimensional grids into hypercubes

Sunday morning, 9:30-12

9:30 - J.R. Griggs (South Carolina), Independent sets and spanning trees with many leaves
10:00 - Y. Zhao (Benedict College), Simultaneous Coloring Problems
10:30 - G.G. Chappell (Southeast Missouri State), Generalized list coloring of planar and outerplanar graphs
11:00 - C.A. Hartman (Alaska - Fairbanks) The subchromatic number
11:30 - P. Winkler (Lucent Technologies), Collision and Percolation

Note: there should be no difficulty making a 12:48 flight after the last talk.
back to main page for Special Session