Graph Theory 2003 November 27-30, 2003

Due to problems in Odense (there is a big congress which has taken almost all hotel rooms in the city at the same time), we have moved the conference to the nice conference center Hotel Storebælt. This is situated in Nyborg close to the sea and easily accessible from the train station at Nyborg. Nyborg is on the way to Odense from Copenhagen.

In due time we will publish guidance here on how to find Hotel Storebælt from Nyborg train station. The distance is 1.5 km.

Conference topics

• Graph connectivity
• Graph colourings
• Directed graphs

Confirmed Participants

• Lars Doevling Andersen Department of Matematics, Aalborg University
• Robert Aldred,Department of Mathematics and Statistics, University of Otago, New Zeeland.
• Jørgen Bang-Jensen, Department of Mathematics and Computer Science, University of Southern Denmark at Odense
• Janos Barat, Department of Mathematics, The Technical University of Denmark
• Alex Berg, BRICS, Department of Computer Science, Aarhus University.
• Stephane Bessy, LAPCS, University Claude Bernard Lyon1
• Adrian Bondy, LAPCS, University Claude Bernard Lyon1 and C.N.R.S Paris
• Stephan Brandt, Department of Mathematics, Technische Universitat Ilmenau
• Hajo Broersma, Department of Mathematics, University of Twente, Enschede Holland.
• Thomas B\"ohme Department of Mathematics, Technische Universitat Ilmenau
• Jens Clausen, Department of Mathematical Modelling, The Technical University of Denmark
• Jan van den Heuvel, Department of Mathematics, London School of Economics.
• Roland Haggkvist, Department of Mathematics, University of Umeå, Sweden.
• Mohammad Hosseini Dolama, Department of Computer Science, University of Bordeaux.
• Tibor Jord\'an, Department of Operations Research, E\"otv\"os University, Budapest, Hungary
• Leif Kjær Jørgensen, Department of Mathematics, Aalborg University, Denmark
• Zolt\'an Kiraly, Department of Computer Science, E\"otv\"os University, Budapest, Hungary
• Matthias Kriesell, Department of Mathematics, University of Hannover
• Bojan Mohar,Department of Mathematics, University of Ljubljana.
• Jaroslav Nesetril Department of Applied Mathematics, Charles University, Prague.
• Morten Hegner Nielsen , Department of Mathematics and Computer Science, University of Southern Denmark, Odense.
• Jens Myrup Pedersen, Department of Control Engineering, Aalborg University
• Mike Plummer Department of Mathematics, Vanderbilt University, Nashville.
• Bert Randerath,Univ. Köln, Inst. für Informatik, Germany
• Andr\'e Raspaud Department of Computer Science, University of Bordeaux.
• Miklos Simonovits Alfréd Rényi Institute of Mathematics, Budapest.
• Eric Sopena Department of Computer Science, University of Bordeaux.
• Michael Stiebitz, Technische Universitat Ilmenau
• Zoltan Szigeti, Equipe Combinatoire, Universite Paris 6, France
• Stephan Thomasse LAPCS, Universite Claude Bernard Lyon 1
• Carsten Thomassen, Department of Mathematics, The Technical University of Denmark
• Bjarne Toft, Department of Mathematics and Computer Science, University of Southern Denmark at Odense
• Preben Dahl Vestergaard, Department of Mathematics, Aalborg University
• Margit Voigt, Department of Mathematics, Technische Universit\"at Ilmenau.
• Sanne Woehlk, Department of Mathematics and Computer Science, University of Southern Denmark at Odense.
• Anders Yeo, Department of Computer Science, Royal Holloway, University of London.

  Abstracts

  Will appear here as I receive them. Please send you abstract (in Latex or pdf) soon!
  • Robert Aldred, Selective 3-edge-colourings and cyclic edge-connectivity in cubic bipartite graphs.
  • Alex Berg, Detachments in digraphs.
  • Stephane Bessy, Three min/max theorems for coherent cyclic orders of digraphs. A proof of a conjecture of Gallai.
  • Thomas Boehme, Minors in large graphs.
  • Adrian Bondy, On a combinatorial number-theoretic problem (abstract still pending).
  • Stephan Brandt, Subgraphs in vertex neighbourhoods of K_r-free graphs.
  • Hajo Broersma, Backbone colorings along spanning trees, spanning paths and perfect matchings.
  • Roland Haggkvist, On the cycle double cover conjecture.
  • Jan van den Heuvel, On the diameter of the transportation polytope.
  • Tibor Jordan, Weakly four-connected graphs, two-connected orientations and removable subgraphs.
  • Zoltan Kir\'aly, Using lambda-supermodularity in dual packing theory
  • Matthias Kriesell, Determining minor minimal k-connected graphs.
  • Bojan Mohar, Acyclic colorings of locally planar graphs.
  • Jarik Nesetril, Projective, strongly rigid and uniquelly colorable graphs.
  • Jens Myrup Pedersen, SqoS and multiple independent paths in Large-Scale networks.
  • Mike Plummer, Some Recent Results in Three Areas of Matching Theory.
  • Bert Randerath, Computational complexity of some colouring problems.
  • André Raspaud, (d,1)-total labelling of planar graphs with large girth and high maximum degree.
  • Miklos Simonovits, Extremal hypergraphs and hypergraph colorings.
  • Eric Sophena, Incidence coloring of graphs.
  • Michael Stiebitz, Color-critical graphs and hypergraphs with few edges.
  • Zoltan Szigeti, On Nash-Williams' orientation theorem
  • Stephan Thomassé, Median orders and coherent cyclic orders of digraphs.
  • Carsten Thomassen, On Hajos' conjecture.
  • Margit Voigt, Coloring problems for planar graphs.
  • Anders Yeo, The number of pancyclic arcs in a k-strong tournament

  Travelinformation

  Click here

  Program click here

  We start in the evening of November 27 with a talk by Bondy followed by a problem session, so please think of some good problems to state here.

  ---

  Last modified: November 20, 2003
  Joergen Bang-Jensen (jbj@imada.sdu.dk)