Meetings

National International Sectional Current Meetings Previous Meetings Presenting Papers Hosting Sectional Meetings Short Courses AMS Conferences Special Lectures Mathematics Calendar In Cooperation with Submitting Abstracts

AMS Sectional Meeting Program by Special Session

Current as of Saturday, April 21, 2007 00:32:16

---

Program  |  Deadlines  |  Registration/Housing/Etc.  |  Inquiries:  meet@ams.org

---

2007 Spring Eastern Section Meeting
Hoboken, NJ, April 14-15, 2007 (Saturday - Sunday)
Meeting #1026

Associate secretaries:
Lesley M Sibner, AMS lsibner@duke.poly.edu

---

Special Session on Graph Theory and Combinatorics

• Saturday April 14, 2007, 8:00 a.m.-10:50 a.m.
  Special Session on Graph Theory and Combinatorics, I
  Room 212, Edwin A. Stevens Building
  Organizers:
  Daniel J. Gross, Seton Hall University grossdan@shu.edu
  Nathan W. Kahl, Seton Hall University kahlnath@shu.edu
  John T. Saccoman, Seton Hall University saccomjt@shu.edu
  Charles L. Suffel, Stevens Institute of Technology csuffel@stevens.edu
  

  • 8:00 a.m.
    A Forbidden Subgraph Condition on the Complement of a Graph that Ensures Minimum Diameter.
    L. William Kazmierczak*, Stevens Institute of Technology
    Frank Boesch, Stevens Institute of Technology
    Daniel Gross, Seton Hall University
    Charles Suffel, Stevens Institute of Technology
    (1026-05-193)
  • 8:30 a.m.
    Some new results on non-planar delta-wye-delta graphs.
    A. Satyanarayana*, Stevens Institute of Technology
    Uma Batchu, Stevens Institute of Technology
    (1026-05-172)
  • 9:00 a.m.
    On the almost-regularity of dense graphs with a maximum number of spanning trees.
    Jose A. Rodriguez*, Computer Science Department Long Island University-Brooklyn Campus
    (1026-05-25)
  • 9:30 a.m.
    Martin/Odlyzko/Wolfram - 20 Years Later.
    Klaus Sutner*, Computer Science Department, Carnegie Mellon University
    (1026-68-56)
  • 10:00 a.m.
    Some Useful Techniques for Bounding Neighbor Connectivity in Abelian Cayley Graphs preliminary report.
    Lynne L. Doty*, Marist College
    (1026-05-57)
  • 10:30 a.m.
    On the Problem of Packing Steiner trees of a Graph.
    Louis Petingi*, Computer Science Department, College of Staten Island, City University of New York
    (1026-05-73)
• Saturday April 14, 2007, 2:30 p.m.-5:20 p.m.
  Special Session on Graph Theory and Combinatorics, II
  Room 212, Edwin A. Stevens Building
  Organizers:
  Daniel J. Gross, Seton Hall University grossdan@shu.edu
  Nathan W. Kahl, Seton Hall University kahlnath@shu.edu
  John T. Saccoman, Seton Hall University saccomjt@shu.edu
  Charles L. Suffel, Stevens Institute of Technology csuffel@stevens.edu
  

  • 2:30 p.m.
    Irregularity Strength of Dense Graphs.
    Bill Cuckler*, University of Delaware
    Felix Lazebnik, University of Delaware
    (1026-05-117)
  • 3:00 p.m.
    Some Algebraic Structures on Rooted Trees.
    Li Guo*, Rutgers University at Newark
    (1026-05-63)
  • 3:30 p.m.
    Path coverings with prescribed ends in hypercubes with faulty nodes.
    Nelson Castaneda*, Central Connecticut State University
    Ivan Gotchev, Central Connecticut State University
    (1026-05-21)
  • 4:00 p.m.
    "Largest Bonds in Graphs".
    Nolan B. McMurray, Jr.*, Texas State University
    Talmage James Reid, University of Mississippi
    Laura Sheppardson, University of Mississippi
    Bing Wei, University of Mississippi
    Haidong Wu, University of Mississippi
    (1026-05-94)
  • 4:30 p.m.
    The prevalence of "paradoxical" dice. II. Tied dice.
    Lorenzo Traldi*, Lafayette College
    Brian Kronenthal, Lafayette College
    (1026-05-22)
  • 5:00 p.m.
    The Distinguishing Chromatic Number and Wreath Products.
    Karen L Collins*, Wesleyan University
    (1026-05-20)
• Sunday April 15, 2007, 8:00 a.m.-10:50 a.m.
  Special Session on Graph Theory and Combinatorics, III
  Room 212, Edwin A. Stevens Building
  Organizers:
  Daniel J. Gross, Seton Hall University grossdan@shu.edu
  Nathan W. Kahl, Seton Hall University kahlnath@shu.edu
  John T. Saccoman, Seton Hall University saccomjt@shu.edu
  Charles L. Suffel, Stevens Institute of Technology csuffel@stevens.edu
  

  • 8:00 a.m.
    Hamiltonian Cycles That Avoid Sets of Edges in a Graph.
    Michael J Ferrara*, University of Colorado at Denver
    Michael S Jacobson, University of Colorado at Denver
    Angela Harris, University of Colorado at Denver
    (1026-05-175)
  • 8:30 a.m.
    Chain covers of chordal bipartite graphs.
    Arthur H. Busch*, University of Dayton
    Atif Abueida, University of Dayton, Department of Mathematics
    R. Sritharan, University of Dayton, Department of Computer Science
    (1026-05-69)
  • 9:00 a.m.
    Sum List Coloring.
    Brian Heinold*, Mount St. Mary's University
    (1026-05-11)
  • 9:30 a.m.
    Dynamic Domination in Graphs.
    Steven B. Horton*, USMA
    Jean R. S. Blair, Department of Electrical Engineering and Computer Science, USMA
    Ralucca Gera, Naval Postgraduate School
    (1026-05-68)
  • 10:00 a.m.
    An Edge Count Criterion for Degree Sequences.
    Garth Isaak*, Lehigh University, Department of Mathematics
    (1026-05-86)
  • 10:30 a.m.
    Multidesigns in graph products.
    Mike Daven*, Mount Saint Mary College
    (1026-05-74)
• Sunday April 15, 2007, 2:30 p.m.-5:20 p.m.
  Special Session on Graph Theory and Combinatorics, IV
  Room 212, Edwin A. Stevens Building
  Organizers:
  Daniel J. Gross, Seton Hall University grossdan@shu.edu
  Nathan W. Kahl, Seton Hall University kahlnath@shu.edu
  John T. Saccoman, Seton Hall University saccomjt@shu.edu
  Charles L. Suffel, Stevens Institute of Technology csuffel@stevens.edu
  

  • 2:30 p.m.
    Graphs whose vertices are graphs with bounded degree.
    Louis V. Quintas*, Pace University
    (1026-05-46)
  • 3:00 p.m.
    Irregularizable Graphs.
    M Brennan, Purchase College (SUNY)
    D Gagliardi, Canton Community College
    M Lewinter*, Purchase College
    (1026-05-15)
  • 3:30 p.m.
    Orbix, LightsOut, and Related Vertex Neighborhood Switching Phenomena.
    John W. Kennedy*, Queen's College, CUNY
    (1026-05-185)
  • 4:00 p.m.
    Improving a Greedy DNA Motif Search Using a Multiple Genomic Self-Adapting Genetic Algorithm.
    Michael L. Gargano*, Pace University
    Louis V. Quintas, Pace University
    Gregory A. Vaughn, St. Francis College
    (1026-05-64)
  • 4:30 p.m.
    Transformations on Digraphs as Intersection Digraphs - New Results.
    Christina MD Zamfirescu*, Hunter College and Graduate Center - CUNY
    (1026-05-208)
  • 5:00 p.m.
    Handshaking Puzzles.
    F. T. Boesch*, Stevens Institute
    (1026-05-23)

Inquiries:  meet@ams.org

---

Quick Links

Special Session Manual