The AMS website will be down for maintenance on October 25th between 6:00pm - 10:00pm ET. This downtime includes registration for the 2019 JMM MEETING in Baltimore. We apologize for any inconvenience this may cause. For questions please contact AMS Customer Service at or (800) 321-4267 (U.S. & Canada), (401) 455-4000 (Worldwide).


AMS Sectional Meeting Program by Special Session

Current as of Tuesday, April 12, 2005 15:09:04

Program  |  Deadlines  |  Inquiries:

Eastern 1993 Spring Sectional Meeting
Washington, DC, April 17-18, 1993
Meeting #881

Associate secretaries:
Lesley M Sibner, AMS

Special Session on Graph Theory

  • Saturday April 17, 1993, 8:30 a.m.-10:50 a.m.
    Special Session on Graph Theory, I

    Room 2006, Downing Hall

    • 8:30 a.m.
      On a problem of Posa and Seymour.
      Ralph Faudree, Memphis State University
      Ronald Gould, Emory University
      Michael S. Jacobson*, University of Louisville
    • 9:00 a.m.
      Toughness and triangle-free graphs.
      D. Bauer*, Stevens Institute of Technology
      J. van den Heuvel, University of Twente, Netherlands
      E. Schmeichel, San Jose State University
    • 9:30 a.m.
      Degree conditions and cycle extendability.
      R. J. Faudree, Memphis State University
      R. J. Gould, Emory University
      M. S. Jacobson, University of Louisville
      L. M. Lesniak*, Drew University
    • 10:00 a.m.
      Monochromatic spanning trees in 2-colored graphs.
      R. J. Faudree*, Memphis State University
      R. J. Gould, Emory University
      M. S. Jacobson, University of Louisville
      L. M. Lesniak, Drew University
    • 10:30 a.m.
      Mixed Ramsey numbers: Total chromatic number and stars.
      Guantao Chen*, North Dakota State University, Fargo
  • Saturday April 17, 1993, 2:40 p.m.-4:30 p.m.
    Special Session on Graph Theory, II

    Room 2006, Downing Hall

    • 2:40 p.m.
      How the rank of a graph is effected by vertex/edge addition or deletion.
      Jean Bevis, Georgia State University
      Kevin Blount, Georgia State University
      George Davis, Georgia State University
      Gayla Domke*, Georgia State University
      Valeria Miller, Georgia State University
    • 3:10 p.m.
      The latest on sphere-of-influence graphs.
      Marc J. Lipman*, Office of Naval Research, Virginia
    • 3:40 p.m.
      On Rado numbers.
      Stefan A. Burr, City College, City University of New York
      S. P. Loo*, West Virginia University
    • 4:10 p.m.
      Either a graph or its complement contains a spanning broom.
      Stefan A. Burr*, City College, City University of New York
  • Sunday April 18, 1993, 9:00 a.m.-10:50 a.m.
    Special Session on Graph Theory, III

    Room 216, Douglass Hall

    • 9:00 a.m.
      Rectilinear crossing number of a complete graph and Sylvester's "Four Point Problem" of geometric probabilty.
      Edward R. Scheinerman*, Johns Hopkins University
      Herbert S. Wilf, University of Pennsylvania
    • 9:30 a.m.
      The Dinitz problem solved for rectangles.
      Jeannette C. M. Janssen*, Lehigh University
    • 10:00 a.m.
      On p-intersection representations.
      Nancy Eaton, University of Rhode Island
      Ronald J. Gould*, Emory University
      Vojtech Rodl, Emory University
    • 10:30 a.m.
      Nowhere-zero 4-flows of solvable Cayley graphs.
      B. Alspach, Simon Fraser University
      Y-P. Liu, Nanjing Normal, People's Republic of China
      C-Q Zhang*, West Virginia University
  • Sunday April 18, 1993, 2:40 p.m.-4:30 p.m.
    Special Session on Graph Theory, IV

    Room 216, Douglass Hall

    • 2:40 p.m.
      Maximal and forbidden unit distance graphs in the plane.
      Carolyn R. Mahoney*, California State University, San Marcos
      Kiran B. Chilakamarri, Central State University
    • 3:10 p.m.
      Extreme values of the edge-neighbor-connectivity.
      Margaret B. Cozzens*, National Science Foundation, Washington, DC
      Shu-Shih Yang Wu, Northeastern University
    • 3:40 p.m.
      Sturdy networks.
      Barry Piazza, University of Southern Mississippi
      Fred Roberts*, Rutgers University, New Brunswick
      Sam Stueckle, Northeastern University
    • 4:10 p.m.
      Strongly connected mixed graphs and connected detachments of graphs.
      C. St. J. A. Nash-Williams*, University of Reading, England

American Mathematical Society