American Mathematical Society

My Account · My Cart · Customer Services · FAQ  

AMS Sectional Meeting Program by Special Session

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


Program  |  Deadlines  |  Inquiries:  meet@ams.org

Southeastern 1994 Spring Sectional Meeting
Lexington, KY, March 18-19, 1994
Meeting #890

Associate secretaries:
Robert J Daverman, AMS daverman@math.utk.edu

Special Session on Graph Theory

  • Friday March 18, 1994, 8:30 a.m.-10:50 a.m.
    Special Session on Graph Theory, I

    Room 313, Business and Economics

    • 8:30 a.m.
      Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling.
      Andr\'e E. K\'ezdy, University of Louisville
      Chi Wang*, University of Louisville
      (890-05-48)
    • 9:00 a.m.
      Chromatic difference sequences.
      Karen L. Collins*, Wesleyan University
      (890-05-21)
    • 9:30 a.m.
      On the ultimate normalized chromatic difference sequence of a graph.
      Huishan Zhou*, Georgia State University
      (890-05-24)
    • 10:00 a.m.
      The greatest common divisor index of a graph.
      Gary Chartrand, Western Michigan University
      Saba Farrokh, Western Michigan University
      Wayne Goddard, University of Pennsylvania
      Grzegorz Kubicki*, University of Louisville
      Christina M. Mynhardt, University of South Africa, Republic of South Africa
      (890-05-85)
    • 10:30 a.m.
      On m-chromatic factorizations of complete graphs.
      Gary Chartrand*, Western Michigan University
      H\'ector Hevia, Universidad Cath\'olica de Valparaiso, Chile
      Ortrud R. Oellermann, Brandon University
      (890-05-52)
  • Friday March 18, 1994, 2:30 p.m.-6:00 p.m.
    Special Session on Graph Theory, II

    Room 313, Business and Economics

    • 2:30 p.m.
      Forbidden subgraphs and Hamiltonian properties.
      Ralph Faudree*, Memphis State University
      Zdenek Ryjacek, University of West Bohemia, Czech Federal Republic
      Ingo Schiermeyer, Technische Hochsuchule Aachen, Germany
      (890-05-77)
    • 3:00 p.m.
      The transfer matrix method for counting cycles and paths on grid graphs.
      Y. H. Harris Kwong*, State University of New York, College at Fredonia
      D. G. Rogers, The University, Aberdeen, United Kingdom
      (890-05-63)
    • 3:30 p.m.
      Large enough rectangles can be tiled, but how large is "enough"?
      Darren A. Narayan, State University of New York, Binghamton
      Allen J. Schwenk*, Western Michigan University
      (890-05-50)
    • 4:00 p.m.
      Graph rigidity and connectivity.
      D. S. Franzblau*, Rutgers University, Piscataway
      (890-05-69)
    • 4:30 p.m.
      Extremal graphs for intersecting triangles.
      P. Erd\"os, Hungarian Academy of Science, Hungary
      Z. F\"uredi, University of Illinois, Urbana-Champaign
      R. J. Gould*, Emory University
      D. S. Gunderson, Emory University
      (890-05-29)
    • 5:00 p.m.
      Problem session
  • Saturday March 19, 1994, 8:30 a.m.-10:50 a.m.
    Special Session on Graph Theory, III

    Room 313, Business and Economics

    • 8:30 a.m.
      The median procedure on median graphs.
      F. R. McMorris*, University of Louisville
      Henry Martyn Mulder, Erasmus University, The Netherlands
      Fred S. Roberts, Rutgers University, New Brunswick
      (890-05-15)
    • 9:00 a.m.
      Venn diagrams and Venn graphs.
      Kiran B. Chilakamarri, Central State University
      Peter Hamburger, Indiana University-Purdue University, Ft.\ Wayne
      Raymond E. Pippert*, Indiana University-Purdue University, Ft.\ Wayne
      (890-05-53)
    • 9:30 a.m.
      Generation of trees with fixed height and bounded degree.
      Kathleen A. McKeon*, Connecticut College
      (890-05-101)
    • 10:00 a.m.
      Using graph theory in statistics.
      Terry McKee*, Wright State University
      (890-05-03)
    • 10:30 a.m.
      Nonmonotonic logics-applications to graph theory.
      Miroslaw Truszczynski*, University of Kentucky
      (890-05-30)
  • Saturday March 19, 1994, 2:30 p.m.-5:20 p.m.
    Special Session on Graph Theory, IV

    Room 313, Business and Economics

    • 2:30 p.m.
      Which short-chorded graphs are balanced? Perfect?
      Olivia M. Carducci*, Lafayette College
      (890-05-51)
    • 3:00 p.m.
      Privacy and irredundance in graphs.
      S. M. Hedetniemi, Clemson University
      S. T. Hedetniemi*, Clemson University
      A. A. McRae, Clemson University
      W. D. Weakley, Indiana University-Purdue University, Ft.\ Wayne
      (890-05-49)
    • 3:30 p.m.
      The toughness of cubic graphs.
      Wayne Goddard*, University of Pennsylvania
      (890-05-44)
    • 4:00 p.m.
      On the product of the independence domination number of a graph and its complement.
      E. J. Cockayne, University of Victoria
      Gerd H. Fricke*, Wright State University
      C. M. Mynhardt, University of South Africa, Republic of South Africa
      (890-05-86)
    • 4:30 p.m.
      A problem in domination.
      Guantao Chen, North Dakota State University
      Michael S. Jacobson*, University of Louisville
      (890-05-45)
    • 5:00 p.m.
      Induced cycles between consecutive ranks of the Boolean algebra.
      Michael S. Jacobson, University of Louisville
      Andr\'e E. K\'ezdy*, University of Louisville
      (890-05-43)
Inquiries:  meet@ams.org