The scientific programme of the conference will consist of lectures by invited speakers and contributed talks. Time limit for each contribution is 25 minutes. Data projector, overhead projector, and whiteboard will be available. The conference programme includes an trip to the Castle of Cerveny Kamen, located about 5 kilometres away from Budmerice.

proceedings

MONDAY

15:00 - 16:00
 Alexander Rosa: Reaction graphs of combinatorial configurations
16:00 - 16:25
 Dalibor Froncek: Oberwolfach Rectangular Table Negotiation Problem
16:25 - 17:00
 Coffee break
17:00 - 17:25
 Tereza Kovářová: Factorizations of the complete graph $K_{2n}$ into isomorphic spanning trees with given diameters
17:25 - 17:50
 Michael Kubesa: Factorizations of Complete Graphs into Caterpillars of Diameter 5
17:55 - 18:20
 Roman Soták: The edge total irregularity strength of complete graphs    ppt
18:20 - 18:45
 Tomáš Vetrík: Decompositions of graphs    pdf



TUESDAY

8:30 - 9:30
 Jan Kratochvíl: Geometric representations of graphs    ppt
9:30 - 9:55
 Martin Pergel: Complexity and complicacy questions of graphs representable by polygons    ps
9:55 - 10:30
 Coffee break
10:30 - 10:55
 Pavel Hrnciar: Minimal eccentric sequences with least eccentricity four
10:55 - 11:20
 Vladimír Vetchý: Square of metrically regular graphs   ppt   pdf
11:25 - 11:50
 Jozef Škorupa: Minimum 4-geodetically connected graphs
11:50 - 12:15
 Ondrej Vacek: Radius-invariant graphs



   lunch

15:00 - 16:00
 Tomáš Kaiser: Matroid intersection and 2-walks in tough graphs    pdf
16:00 - 16:25
 Petr Kolman: Single Source Multiroute Flows and Cuts on  Uniform Capacity Networks  
16:25 - 17:00
 Coffee break
17:00 - 17:25
 Přemysl Holub: Edge Closure Concept in Claw-Free Graphs
17:25 - 17:50
 Jan Karabas: $H$-hamiltonicity of 3-valent polyhedral graphs
17:55 - 18:20
 Peter Katrenič: Partition problems and kernels of graphs  ppt
18:20 - 18:45
 Pavel Híc: A Note on Families of Integral Trees of Diameter 4, 6, 8, and 10    ppt



WEDNESDAY

8:30 - 9:30
 Riste Škrekovski: Coloring squares of planar/sparse graphs
9:30 - 9:55
 Roman Čada: Reduction theorem for bicolored prime graphs
9:55 - 10:30
 Coffee break
10:30 - 11:30
 Martin Kochol: Large Applications of superposition in graph theroy    pdf   ps
11:30 - 11:55
 Peter Mihók: Reducible graph properties
11:55 - 12:20
 Naďa Krivoňáková: Edge-coloring of multigraphs    pps   ppt



   lunch, trip

THURSDAY

8:30 - 9:30
 Roman Nedela: Regular embeddings of complete bipartite graphs
9:30 - 9:55
 Ľubica Staneková: Exponents of $t$-balanced Cayley maps
9:55 - 10:30
 Coffee break
10:30 - 10:55
 Marcel Abas: Hamiltonian Cayley maps of $K_n$
10:55 - 11:20
 Milan Tuharsky: On maps with the face incident with all vertices
11:25 - 11:50
 Róbert Hajduk: Rings maps $M_n(7,5)$   pdf
11:50 - 12:15
 Tatiana Jajcayová: Graphs in combinatorial theory of semigroups



   lunch

15:00 - 16:00
 Róbert Jajcay: Representing finte groups via regular actions on combinatorial structures
16:00 - 16:25
 Mirko Horňák: On-line arbitrarily vertex decomposable trees
16:25 - 17:00
 Coffee break
17:00 - 17:25
 Daniel Kráľ: Channel assignment problem with variable weights    ps
17:25 - 17:50
 Janka Rudašová: Observability of some regular graphs    ppt
17:55 - 18:45
 Problem session



   conference dinner

FRIDAY

8:30 - 9:30
 Martin Bača: On labelings of graphs
9:30 - 9:55
 Petr Kovář: Magic labelings of regular graphs   ps (50 MB)
9:55 - 10:30
 Coffee break
10:30 - 10:55
 Ľubomír Török: Antibandwidth and Cyclic Antibandwidth of Meshes and Hypercubes    pdf   ppt
17:55 - 11:20
 Mariusz Meszka: Paths Decomposition of Complete Multidigraph    pps