DIMACS/DIMATIA/Renyi Working Group on Graph Colorings and their Generalizations

First Meeting Dates: October 13 - 15, 2003
DIMACS Center, Rutgers University, Piscataway, New Jersey

Organizers:
Fred S. Roberts, DIMACS, froberts@dimacs.rutgers.edu
Stephen Hartke, Rutgers University, hartke@math.rutgers.edu
The Rényi Institute Home Page

DIMACS/DIMATIA/Rényi Working Group on Graph Colorings and their Generalizations Main Page

DIMACS/DIMATIA/Renyi Tripartite Partnership

Workshop Program:


Monday, October 13, 2003

 8:10 -  8:50  Registration and breakfast

 8:50 -  9:00  Welcome and Opening Remarks
               Fred Roberts, Director of DIMACS

 9:00 -  9:30  Choosability problems for $(d,s)$-colorings
               Zsolt Tuza, Hungarian Academy of Sciences, Budapest

 9:40 - 10:10  L(2,1)-Colored Trees of Maxdegree 3 and Span 5
               Peter Fishburn, AT&T Labs

10:20 - 10:40  Break and discussion

10:40 - 11:10  L(2,1) - Labeling of Products of Two Cycles
               Denise Sakai Troxell, Babson College

11:20 - 12:00  Coloring Unit Distance Graph of the Plane
               Alexander Soifer, DIMACS, Princeton University, and
               University of Colorado at Colorado Springs

12:10 -  1:30  Lunch

 1:30 -  2:00  Between 2- and 3-colorability
               Vadim Lozin, RUTCOR

 2:10 -  2:40  Irreducible No-hole Colorability of some Classes of Graphs
               Renu Laskar, Clemson University

 2:50 -  3:20  Irreducibility of L(2,1)-Colorings and the
               Inh-Colorability of unicylic and hex graphs
               John Villalpando, Clemson University and Gonzaga University

 3:30 -  4:10  Break and discussion

 4:10 -  4:50  Problem session

 6:00          Dinner

Tuesday, October 14, 2003

 8:20 -  9:00  Breakfast

 9:00 -  9:30  Real Number Channel Assignments with Distance Conditions
               Jerrold R. Griggs, University of South Carolina

 9:40 - 10:00  Real Number Graph Labeling for the Triangular Lattice and the Square Lattice
               Teresa Xiaohua Jin, University of South Carolina

10:00 - 10:30  Break and discussion

10:30 - 11:10  Local chromatic number and Sperner capacity
               Gabor Simonyi, Renyi Institute

11:20 - 12:00  Using Hypergraph Homomorphisms to Guess Three Secrets
               Nathan Segerlind, Institute for Advanced Study
               

12:00 -  1:30  Lunch

 1:30 -  2:10  Consensus List Colorings of Graphs and Physical Mapping of DNA
               Fred Roberts, DIMACS

 2:20 -  2:50  Kernel-Solvable Graphs, Core-Solvable Cooperative Games,
               and List Coloring Conjecture
               Vladimir Gurvich, RUTCOR

 3:00 -  3:30  Break and discussion

 3:40 -  4:20  Partial Covers and Distance Constrained Labellings of Graphs
               Jan Kratochvil,  DIMATIA

 4:30 -  5:00  Minimum Covering by Cliques of Perfect Filament Graphs
               Fanica Gavril, DIMACS, Rutgers University

Wednesday, October 15, 2003

 8:20 -  9:00  Breakfast

 9:00 -  9:40  Coloring Powers of Chordal Graphs and L(2,1)-labeling
               Daniel Kral, Charles University

 9:50 - 10:30  Adjacent Vertex Distinguishing Edge-colorings
               Ervin Gyori, Renyi Institute

10:30 - 10:50  Break and discussion

10:50 - 11:20  Multi-level Distance Labeling
               Daphne Liu, California State University

11:30 - 12:10  On locally constrained graph homomorphisms
               Jiri Fiala, Charles University

12:10 -  1:30  Lunch

1:30           Discussion and collaboration
Previous: Participation
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on October 13, 2003.