Graph Theory 2007 December 6-9, 2007
This is the web page for the graph theory meeting at
Trinity, Fredericia, Denmark
December 6-9, 2007
The meeting is over.
Thanks to all participants for making it an exciting meeting. You can see pictures here.
The conference is planned to be held in the nice conference center Trinity
close to the sea (Lillebælt) and easily accessible from the train
station at Fredericia. Fredericia is easily accessible by train
from Copenhagen. You may aklso stop in Middelfart.
Getting from Fredericia or Middelfart to Trinity
You should take a taxi (about 6 km for both train stations).
Conference topics
- Industrial applications of discrete mathematics
- Graph connectivity
- Graph colourings
- Directed graphs
Participants
- Jørgen Bang-Jensen,
Department of Mathematics and Computer Science, University of Southern
Denmark at Odense
- 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 Computer Science, University of Durham
- Marco
Chiarandini, Department of Mathematics and Computer Science,
University of Southern Denmark.
- Louis Esperet, LabRI, Universite Bordeaux 1, France
- Bernhard Fuchs, TU Braunschweig
- Daniel Goncalves,
LIRMM, University of Montpellier II
- Gregory Gutin, Department of Computer Science, Royal
Holloway, University of London.
- Inge Li Gørtz, Department of
Informatics and Mathematical Modelling, The Technical University of Denmark.
- Frederic Havet, INRIA Sophia-Antipolis, Nice France
- Jan van den
Heuvel, Department of
Mathematics, London School of Economics.
- Thore Husfeldt, Department of Computer Science, University of Lund, Sweden
- Bill Jackson, School of Mathematical Sciences, Queen Mary, University of London.
- Tibor Jordán, Department
of Operations Research, Eötvös University, Budapest, Hungary
- Leif Kjær
Jørgensen,
Department of Mathematics, Aalborg University, Denmark
- Matthias Kriesell, Department of Mathematics,
University of Hamburg
- Daniella Kuehn, School of Mathematics
Birmingham University
- Christian Loewenstein, Department of Mathematics, Technische Universitat Ilmenau
- Yury Nikulin, Department of Mathematics and Computer Science, University of Southern Denmark
- Deryk Osthus,School of Mathematics
Birmingham University
- Anders Sune Pedersen, Department of Mathematics and Computer Science, University of Southern Denmark.
- Dieter Rautenbach, Department of Mathematics, Technische Universitat Ilmenau
- Friedrich Regen, Department of Mathematics, Technische Universitat Ilmenau
- Diego Scheide, Department of Mathematics, Technische Universitat Ilmenau
- Michael
Stiebitz, Department of Mathematics, Technische Universitat Ilmenau
- Carsten
Thomassen,
Department of Mathematics, The Technical University of Denmark
- Bjarne Toft,
Department of Mathematics and Computer Science, University of Southern Denmark
- Preben Dahl Vestergaard, Department of Mathematics,
Aalborg University
- Paul Wollan, Department of Mathematics, University of Hamburg
- Anders Yeo, Department of Computer Science, Royal
Holloway, University of London.
Program is ready click here
Abstracts
Will appear here as I receive them. Please send you abstract (in Latex
or pdf) soon!
- Hajo Broersma, Sharp upper bounds for the minimum number of components of 2-factors in claw-free graphs
- Stephan Brandt, Colouring and distinguishing edges by total labellings
- Marco Chiarandini, A computational study for the 2-edge-connectivity augmentation problem
- Louis Esperet, Adapted list colouring of planar graphs
- Bernhard Fuchs, Approximating Range Assignment Problems
- Daniel Goncalves, Planar graphs and intersection graphs of segments
- Gregory Gutin, Parameterized Algorithms for Directed Maximum Leaf Problems
- Frederic Havet, L(p,q)-labelling of graphs
- Jan van den Heuvel, Circular orderings of matroids
- Thore Husfeldt, Computing the Tutte polynomial in vertex-exponential time
- Bill Jackson, An inequality for Tutte polynomials
- Tommy Jensen, Some Properties of Lov\'asz's Theta Number
- Tibor Jordan, Edge-disjoint spanning trees, brick partitions and body-and-pin frameworks
- Matthias Kriesell, Degree sequences and edge-connectivity
- Daniella Kuehn, Hamilton cycles in oriented graphs
- Yury Nikulin, Heuristics for the central tree problem
- Deryk Osthus, Linkedness and ordered cycles in directed graphs
- Anders Sune Pedersen, Double-critical and contraction-critical graphs
- Dieter Rautenbach, Locally Dense Independent Sets in Regular Graphs of Large Girth
- Diego Scheide, Tashkinov trees and edge-colourings of multigraphs
- Michael Stiebitz, Vizing's colouring algorithm and the fan number
- Carsten Thomassen, Graph Decomposition
- Paul Wollan,Complete minors in large 6-connected graphs
- Anders Yeo Total domination in 2-connected graphs and transversals in
hypergraphs
We start in the evening of December 6 with a problem session, so please think of some good problems to state here.
Last modified: Mon Dec 10 15:14:10 CET 2007
Joergen Bang-Jensen
(jbj@imada.sdu.dk)