| | | | | | | | | | | | | |
| Monday
|
|
| | Choosability of planar graphs | | Tomáš Vyskočil |
| | Horn Minimalization | | Petr Kučera |
|
| Tuesday
| | New 3-coloring criterion for planar graphs | | Mirka Sotáková |
| | Description Trees and Tutte's formulas | | Peter Bella |
| | Conflict-free Colorings | | Aleš Přívětivý |
| | The Intristic Dimensionality of Graphs | | Jan Štola |
|
| Wednesday
|
| | On Hamiltonicity in Locally Connected Claw-free Graphs | | Přemek Holub |
| | Triangles in Random Graph | | Ondřej Pangrác |
| | Bounded Degree Spanning Tree | | Jakub Teska |
| | Moves on Triangulation | | Martin Bálek |
|
| Thursday
|
| | Generalized Tic-Tac-Toe | | Tomáš Valla |
| | 3-choosability of Planar Graphs with Girth 5 | | Ida Švejdarová |
| | Dynamic Algorithm for Representation of Interval Graphs | | Eva Ondráčková |
| | Self-stabilizing Algorithms on Trees | | Martin Mareš |
|
| Friday
| | Coloring Powers of Chordal Graphs | | Dan Kráľ |
| | Girth of Sparse Graphs | | Marek Sulovský |
| | Sufficient Conditions for Correct Tree Reconstruction | | Martin Tancer |
| | Non-crossing Hamiltonial Paths in Geometric Graphs | | Jakub Černý |
| | Turán Density of Triple Systems | | Vít Jelínek |
|
| Saturday
| | Powers of Posets and Graphs | | David Stanovský |
|
| | Complicacy PC-graphs | | Martin Pergl |
| | Strong T-perfection of Graphs without Bad K4 | | Pavel Nejedlý |
|