5:30 p.m. Facial coloring. Frederic Havet*, Projet Mascotte, I3S(CNRS/UNSA) and INRIA, Sophia-Antipolis
Daniel Kral, ITI Charles University, Prague
Jean-Sebastien Sereni, KAM and ITI Charles University, Prague
Riste Skrekovski, Department of Mathematics, University of Ljubljana
(1037-05-127)
9:30 a.m. Connectivity of random addable graphs. Stefanie Gerke*, Royal Holloway College
Paul Balister, University of Memphis
Bela Bollobas, Trinity College Cambridge and University of Memphis
(1037-05-200)
3:00 p.m. Fullerene graphs - combinatorics meets chemistry. Frantisek Kardos, University of Pavol Jozef Safarik, Kosice
Daniel Kral*, Institute for Theoretical Computer Science (ITI), Charles University, Prague
Jozef Miskuf, University of Pavol Jozef Safarik, Kosice
Jean-Sebastien Sereni, DIMATIA, Charles University, Prague
(1037-05-109)
4:00 p.m. Blockers and transversals. Cedric Bentz, Universit\'e Paris Sud
Marie-Christine Costa, CNAM, Paris
Dominique de Werra, EPFL, Lausanne
Christophe Picouleau, CNAM, Paris
Bernard Ries*, EPFL, Lausanne
Rico Zenklusen, ETHZ, Zurich
(1037-05-170)
4:30 p.m. Lehman matrices. Gerard Cornuejols*, Carnegie Mellon University
Bertrand Guenin, University of Waterloo
Levent Tuncel, University of Waterloo
(1037-05-98)
5:00 p.m. On Quasi-bipartite Graphs. Guoli Ding*, LSU
Li Feng, The University of Hong Kong
Wenan Zang, The University of Hong Kong
(1037-05-212)
10:00 a.m. When do two graphs have the same set of even cycles? Bertrand Guenin*, Dept. of Combinatorics and Optimization, University of Waterloo
Irene Pivotto, Dept. of Combinatorics and Optimization, University of Waterloo
Paul Wollan, University of Hamburg
(1037-05-304)