| Čas |
Program |
| 10:30 |
coffee-break |
| 10:50 |
Stanislav Jendroľ Path of low weight in planar graphs |
| 11:40 |
Peter Mihók*, Izak Broere and Jozef Bucko Criteria of the existence of uniquely partitionable graphs and combinatorial structures |
| 12:00 |
Mirko Horňák*, Norma Zagaglia Salvi On the point-distinguishing chromatic index of complete bipartite graphs |
| 12:20 |
Michal Tkáč Cycles in planar graphs |
| 13:00 |
oběd / lunch |
| 14:30 |
Zdeněk Ryjáček Forbidden subgraphs and closure concepts |
| 15:30 |
coffee-break |
| 16:00 |
Roman Kužel*, Liming Xiong A note on the Thomassen's conjecture |
| 16:25 |
Přemysl Holub*, L. Xiong Distance local connectivity and hamiltonian index |
| 16:50 |
Pavel Híc*, Milan Pokorný On integral trees of the large order |
| 18:00 |
večeře / dinner |
| 19:00 |
uvítací večírek / welcome party |
| Čas |
Program |
| 8:00 |
snídaně / breakfast |
| 9:00 |
Ladislav Nebeský Signposts in a graph |
| 10:00 |
coffee-break |
| 10:30 |
Tomáš Kaiser*, Riste Škrekovski Decompositions of planar graphs |
| 10:55 |
Dalibor Fronček*, Michael Kubesa Decompositions of complete graphs of even order into isomorphic spanning trees |
| 11:20 |
Michael Kubesa Spanning tree factorizations of complete graphs |
| 11:45 |
Bohdan Zelinka Domination in infinite graphs |
| 12:30 |
oběd / lunch |
| 14:00 |
Alexander Rosa*, Mariusz Meszka Embedding steiner triple systems into steiner systems S(2,4,v) |
| 15:00 |
coffee-break |
| 15:30 |
Jaroslaw Grytczuk*, Mariusz Haluszczak Non-repetitive colorings of graphs |
| 15:55 |
Martin Škoviera Colouring cubic graphs by Steiner triple systems |
| 16:20 |
Mike Grannell, Terry Griggs, Martin Knor*, and Martin Škoviera Every cubic graph is STS(381)-colourable |
| 16:45 |
Peter Jacko, Andrea Marcinová* The distance colouring of regular tilings of the plane |
| 17:10 |
Jiří Fiala*, Riste Škrekovski List distance-labelings of graphs |
| 18:00 |
večeře / dinner |
| 19:00 |
Červeným vrchem |
| Čas |
Program |
| 8:00 |
snídaně / breakfast |
| 9:00 |
Jozef Širáň Cantankerous maps |
| 10:00 |
coffee-break |
| 10:30 |
Jan Kratochvíl Distant, disjoint and distinct representatives |
| 10:55 |
Daniel Kráľ*, Heinz-Juergen Voss Edge-disjoint odd cycles in planar graphs |
| 11:20 |
Erik Bruoth*, Mirko Horňák Ranking numbers of platonic solids |
| 11:45 |
Tomáš Madaras On light cycles in families of plane graphs |
| 12:30 |
oběd / lunch |
| 14:00 |
František Franěk Erdös's conjecture on multiciplities of complete subgraphs |
| 15:00 |
coffee-break |
| 15:30 |
Roman Nedela Representation of 3-manifolds by 4-edge-coloured graphs |
| 15:55 |
Jan Karabas G-minimal representatives of 3-manifolds of genus 2 |
| 16:20 |
Martin Nehéz Sense of Direction and Shortest-Path Routing on Random Regular Graphs |
| 16:45 |
Aleksander Vesel Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of domination numbers |
| 17:10 |
Petr Hliněný Branch-decompositions and the tutte polynomial of representable matroids |
| 19:00 |
slavnostní večeře / conference dinner |