| Monday |
06/06/11 |
|
|
| 14:00-14:50 |
|
Martin Škoviera |
Snarks – recent development |
| 14:50-15:20 |
Coffee break |
|
|
| 15:20-15:40 |
|
Martin Mačaj |
O vzťahoch medzi silne regulárnymi grafmi |
| 15:40-16:00 |
|
Edita Máčajová |
Cycle covers of signed graphs |
| 16:00-16:20 |
|
Michal Kotrbčík |
Obstructions for high-genus embeddings |
| 16:20-16:30 |
Break |
|
|
| 16:30-16:50 |
|
Robert Lukoťka |
Maximal k-degenerated subgraph of a planar graph |
| 16:50-17:10 |
|
Marcel Abas |
Isomorphism of reverse Cayley digraphs for symmetric and alternating groups |
| 17:10-17:30 |
|
Mária Ždímalová |
Construction of large Cayley digraphs of given degree and diameter from sharply t-transitive groups |
| 18:00 |
Dinner |
|
|
| 19:00 |
Welcome party |
|
|
|
|
|
|
| Tuesday |
06/07/11 |
|
|
| 9:00-9:50 |
|
František Kardoš |
Perfect matchings in cubic graphs |
| 9:50-10:20 |
Coffee break |
|
|
| 10:20-10:40 |
|
Martin Knor |
Hyperbolic fullerenes |
| 10:40-11:00 |
|
Erika Škrabuľáková |
Upper bounds for the facial Thue choice index of plane graphs |
| 11:00-11:10 |
Break |
|
|
| 11:10-11:30 |
|
Ewa Kozlowska-Walania |
On the real nerve of the moduli space of Riemann surfaces - a combinatorial approach |
| 11:30-11:50 |
|
Ján Karabáš |
Classification of edge-transitive maps |
| 12:00-14:00 |
Lunch |
|
|
| 14:00-14:50 |
|
Mariusz Meszka |
Almost resolvable cycle systems |
| 14:50-15:20 |
Coffee break |
|
|
| 15:20-15:40 |
|
Petr Kovář |
Distance magic labeling of 4-regular graphs |
| 15:40-16:00 |
|
Adam Silber |
Distance magic labeling of regular graphs |
| 16:00-16:20 |
|
Dalibor Fronček |
Distance magic labeling of hypercubes |
| 16:20-16:30 |
Break |
|
|
| 16:30-16:50 |
|
Marko Milošević |
Star complements in strongly regular graphs |
| 16:50-17:10 |
|
Štefan Gyurki |
On the difference of the domination number of a digraph and of its reverse |
| 17:10-17:30 |
|
Veronika Bachratá |
Mapy s krátkymi cyklami |
| 18:00 |
Dinner |
|
|
|
|
|
|
| Wednesday |
06/08/11 |
|
|
| 9:00-9:50 |
|
Mirko Horňák |
On edge colourings distinguishing vertices |
| 9:50-10:20 |
Coffee break |
|
|
| 10:20-11:10 |
|
Dragan Stevanović |
Maximum decrease in the largest adjacency eigenvalue of a graph by edge deletions |
| 11:10-11:20 |
Break |
|
|
| 11:20-11:40 |
|
Milan Pokorný |
A Note on Q-integral Complete Multipartite Graphs |
| 11:40-12:00 |
|
Alexander Ilić
|
Effcient algorithms on trapezoid graphs
|
| 12:00-14:00 |
Lunch |
|
|
| 14:00-18:00 |
Trip |
|
Špania dolina / Harmanecká jaskyňa (bad weather conditions) |
| 18:00:00 |
Dinner |
|
|
|
|
|
|
| Thursday |
06/09/11 |
|
|
| 9:00-9:50 |
|
Robert Šámal |
Manifold Petersen coloring |
| 9:50-10:20 |
Coffee break |
|
|
| 10:20-10:40 |
|
Martin Bača |
Super antimagicness of disconnected graphs |
| 10:40-11:00 |
|
Andrea Feňovčíková |
Face antimagic labelings of graphs |
| 11:00-11:10 |
Break |
|
|
| 11:10-11:30 |
|
Ľudmila Bezegová |
Conservative graphs and degree-magic labellings |
| 11:30-11:50 |
|
Jan Ekstein |
Packing Chromatic Number of Distance Graphs |
| 12:00-14:00 |
Lunch |
|
|
| 14:00-14:50 |
|
Gyula Katona |
A new direction in Hamiltonian theory |
| 14:50-15:20 |
Coffee break |
|
|
| 15:20-15:40 |
|
Zdeněk Ryjáček |
Clique coverings and degree conditions for Hamilton-connectedness in claw-free graphs |
| 15:40-16:00 |
|
Roman Čada |
2-factors with long cycles in claw-free graphs |
| 16:00-16:20 |
|
Radek Slíva |
2-factors of claw-free graphs |
| 16:20-16:30 |
Break |
|
|
| 16:30-16:50 |
|
Přemek Holub |
The rainbow connection number of 2-connected graphs |
| 16:50-17:10 |
|
Petr Vrána |
Line graphs of multigraphs and 1-Hamilton-connectedness of claw-free graphs |
| 17:10-17:30 |
|
Ľubomír Török |
Antidilatation in graphs |
| 19:00 |
Conference dinner |
|
|
|
|
|
|
| Friday |
06/10/11 |
|
|
| 9:30-10:20 |
|
Jan Kratochvíl |
Exact exponential algorithms for distance constrained labeling of graphs |
| 10:20-10:50 |
Coffee break |
|
|
| 10:50-11:10 |
|
Gabriela Karafová |
Simplification of the linear program for generalized fractional total coloring of complete graphs |
| 11:10-11:30 |
|
Kan Hu |
Classification of regular embeddings of cycles with multiple edges |
| 12:00-14:00 |
Lunch |
|
|
