AMS Sectional Meeting Program by Special Session

Current as of Tuesday, April 12, 2005 15:08:51

Program | Deadlines | Inquiries: meet@ams.org

Associate secretaries:
Andy R Magid, AMS amagid@ou.edu

Friday October 25, 1991, 8:00 a.m.-9:50 a.m.
Special Session on Graph Theory, I
Family Life Center, Room 319, Memorial Union
- 8:00 a.m.
  Local indecomposability of certain geometric graphs.
  Jonathan I. Hall*, Michigan State University
  (869-05-76)
- 8:30 a.m.
  Crossings on edges in graph drawings.
  Heiko Harborth*, University of Braunschweig, Germany
  (869-05-43)
- 9:00 a.m.
  Connectivity and strong maps of matroids.
  Talmage James Reid*, University of Mississippi
  (869-05-19)
- 9:30 a.m.
  Some new results on the limit points of eigenvalues of graphs.
  Michael Doob*, University of Manitoba
  (869-05-178)

Friday October 25, 1991, 2:00 p.m.-4:20 p.m.
Special Session on Graph Theory, II
Family Life Center, Room 319, Memorial Union
- 2:00 p.m.
  Efficient domination of the orientations of a graph.
  David W. Bange*, University of Wisconsin-La Crosse
  Anthony E. Barkauskas, University of Wisconsin-La Crosse
  Linda H. Host, University of Wisconsin-La Crosse
  Lane H. Clark, Southern Illinois University
  (869-05-95)
- 2:30 p.m.
  Efficient dominating sets in oriented trees.
  David W. Bange, University of Wisconsin, La Crosse
  Anthony E. Barkauskas*, University of Wisconsin, La Crosse
  Linda H. Host, University of Wisconsin, La Crosse
  Lane H. Clark, Southern Illinois University, Carbondale
  (869-05-96)
- 3:00 p.m.
  The spanning tree enumeration problem for diagraphs.
  Nathaniel Dean*, Bellcore, Morristown, New Jersey
  Peter Winkler, Bellcore, Morristown, New Jersey
  A. K. Kelmans, Bellcore, Morristown, New Jersey
  Keh Wei Lih, Bellcore, Morristown, New Jersey
  William A. Massey, Bellcore, Morristown, New Jersey
  (869-05-130)
- 3:30 p.m.
  HISTs in planar and toroidal graphs.
  Joan P. Hutchinson*, Macalester College
  (869-05-145)
- 4:00 p.m.
  The number of multicolored spanning trees in minimum biclique decompositions.
  Jiuqiang Liu, Western Michigan University
  Allen Schwenk*, Western Michigan University
  (869-05-141)

Saturday October 26, 1991, 7:30 a.m.-9:50 a.m.
Special Session on Graph Theory, III
Family Life Center, Room 124, Memorial Union
- 7:30 a.m.
  Interval two-step graphs.
  J. Richard Lundgren*, University of Colorado, Denver
  Craig Rasmussen, University of Colorado, Denver
  John S. Maybee, University of Colorado, Boulder
  (869-05-72)
- 8:00 a.m.
  New results and open problems in graph labelings.
  Joseph A. Gallian*, University of Minnesota, Duluth
  (869-05-97)
- 8:30 a.m.
  Neighborhood unions and the cycle cover number of a graph.
  Guantao Chen, Memphis State University
  Ronald J. Gould, Emory University
  Michael S. Jacobson*, University of Louisville
  Richard H. Schelp, Memphis State University
  (869-05-28)
- 9:00 a.m.
  Balanced networks.
  William Kocay*, University of Manitoba
  Doug Stone, University of Manitoba
  (869-05-77)
- 9:30 a.m.
  Old and new problems in graph theory.
  Paul Erd\"os*, Hungarian Academy of Science, Hungary
  (869-05-125)

Saturday October 26, 1991, 2:00 p.m.-4:20 p.m.
Special Session on Graph Theory, IV
Family Life Center, Room 124, Memorial Union
- 2:00 p.m.
  My favorite problems in Ramsey theory.
  R. L. Graham*, AT&T Bell Laboratories, Murray Hill, New Jersey
  (869-05-60)
- 2:30 p.m.
  Graphs with Linearly bounded Ramsey numbers.
  Guantao Chen, Memphis State University
  R. H. Schelp*, Memphis State University
  (869-05-61)
- 3:00 p.m.
  Methods for evolving useful graphs.
  Geoffrey Exoo*, Indiana State University
  (869-05-165)
- 3:30 p.m.
  Subgraphs of a hypercube containing no small even cycles.
  Fan R. K. Chung*, Bellcore, Morristown, New Jersey
  (869-05-160)
- 4:00 p.m.
  Path pariable graphs.
  Ralph Faudree*, Memphis State University
  (869-05-51)

Inquiries: meet@ams.org