Elgersburg, Germany, March 21 - 25, 2011
Lectures
Lectures of invited Speakers
A. Bondy: Induced decompositions of graphs
M. Chudnovsky: Tournament heroes
B. Mohar: Immersions in graphs and digraphs
A. Raspaud: Partitions of graphs with bounded maximum average degree
A. Saito: Forbidden subgraphs and 2-factors
P. Seymour: Disjoint paths in tournaments
C. Thomassen: The weak 3-flow conjecture
Contributed Talks
E. Aigner-Horev: Decomposing infinite matroids into their $3$-connected minors
J. Bang-Jensen: Finding an induced subdivision of a digraph
J.-P. Bode: Rainbow Cycles in Cube Graphs
M. Borowiecki: Minimum feedback vertex set in graphs
J. Carmesin: The k-connected components of a graph
M. Frick: Traceability of Oriented Graphs with Independence Number Two
A. Fricke: Extending Bondy's Theorem: Further Results
J.-O. Froehlich: Taming the apex set
F. Goering: Preserving high connectivity
H. Harborth: Cube graphs with saturated edge rainbow colorings
M. Henning: 2-Colorings in k-Regular k-Uniform Hypergraphs
M. Horňák: Rank number of a prism
R. Kalinowski, M. Woźniak: On arbitrarily partitionable graphs
F. Kardoš: Fractional total colorings of graphs with large girth
M. Koch: Maximum weight of a connected graph of given order and size
A. Kohl: On $b$-colorings of graphs with independence number 2
S. Jendrol': Nonrepetitive vertex colourings of graphs
M. Kriesell: Nonseparating $K_4$-subdivisions in graphs of minimum degree at least $4$
C. Loewenstein: Hamilton Paths and Cycles in Distance Graphs
V. Lozin: On factorial properties of graphs
A. Maddaloni: The complexity of finding disjoint cycles and dicycles in a digraph with cycle transversal number 1
M. Marangio: Generalized Colourings of Distance Graphs
S. Matos Camacho: Stars in Minimum Rainbow Subgraphs
M. Miller: Recent Advances in the Degree/Diameter Problem
F. Pfender: Degree Conditions for $H$-linked Digraphs
Z. Ryjáček: Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
P. M. Schaefer: On finite convexity spaces induced by sets of paths in graphs
S. Simonsen: The complexity of finding disjoint cycles and dicycles in a digraph with cycle transversal number 2
R. Soták: Generalized fractional and circular colorings
S. van Aardt: The Traceability Conjecture for Oriented Graphs holds for k<8
C. Zamfirescu: Acute Triangulations of Surfaces
