The conference begins with lunch on Monday June 1, 2015, at 13:00 and ends with lunch on Friday June 5 at 12:00. The traditional conference trip is planned for Wednesday afternoon. The programme for each of the remaining 7 halfdays will comprise one invited and several contributed talks.

Tentative programme

If you have any comments regarding the proposed programme, please write to

Monday, June 1

13:00-14:00 Lunch
14:30-15:20 R. Nedela Hamilton cycles in cubic maps
15:20-15:40 Coffee break
15:40-16:00 M. Škoviera Cyclic connectivity and edge-removal in cubic graphs
16:05-16:25 K. Hriňáková Regular maps on some types of matrix groups and their external symmetries
16:35-16:55 B. Candráková Travelling salesman problem on cubic graphs
17:00-17:30 Problem session
18:30-19:30 Dinner
19:30- Welcome party

Tuesday, June 2

8:00-9:00 Breakfast
9:00-9:50 J. Mazák Circular chromatic number of line graphs and total graphs
9:50-10:10 Coffee break
10:10-10:30 E. Máčajová The difference between the circular and the integer flow number of bidirected graphs
10:35-10:55 P. Hell List homomorphisms - time and space
11:05-11:25 R. Lukoťka Perfect matchings in regular bipartite graphs
11:30-11:50 T. Gavenčiak The game of cops and robbers on intersection graphs
12:00-13:00 Lunch
15:00-15:50 M. Loebl Graph colorings and hyperdeterminants
15:50-16:10 Coffee break
16:10-16:30 S. Gyürki New infinite families of directed strongly regular graphs using equitable partitions
16:35-16:55 V. Diego Distance mean-regular graphs
17:05-17:25 P. Klavík Automorphism groups of geometrically represented graphs
17:30-17:50 M. Knor A congruence relation for the Wiener index
18:30-19:30 Dinner

Wednesday, June 3

8:00-9:00 Breakfast
9:00-9:50 D. Fronček Kotzig arrays three generations later
9:50-10:10 Coffee break
10:10-10:30 A. Rosa Decomposing complete 3-uniform hypergraphs and ρ-labellings
10:35-10:55 F. Matúš On classes of matroids closed to the minors and principal extensions
11:10-11:20 M. Tyniec Orthogonal one-factorizations of complete multipartite graphs
12:00-13:00 Lunch
13:00-19:00 Conference trip
19:00-20:00 Dinner

Thursday, June 4

8:00-9:00 Breakfast
9:00-9:50 M. Kriesell Maximally ambiguously k-colorable graphs
9:50-10:10 Coffee break
10:10-10:30 P. Šugerek Mi -edge colorings of complete graphs
10:35-10:55 F. Kardoš Computer-assisted proof of a Barnette conjecture
11:05-11:25 B. Li Spectral analogues of Erdős’ and Moon-Moser’s theorems on Hamilton cycles
11:30-11:50 R. Soták Short paths in graphs with bounded average degree
12:00-13:00 Lunch
15:00-15:50 J. Czap Properties of 1-planar graphs
15:50-16:10 Coffee break
16:10-16:30 I. Fabrici Facially proper colorings of plane graphs
16:35-16:55 M. Maceková Structure of 3-paths in plane graphs of given girth
17:05-17:25 P. Hudák Light stars and cycles in planar graphs with large girth
17:30-17:50 J. Ryan The degree diameter subgraph problem
19:00- Conference dinner

Friday, June 5

8:00-9:00 Breakfast
9:00-9:50 B. Lidický Flag algebras and some applications
9:50-10:10 Coffee break
10:10-10:30 Š. Petříčková Maximal triangle-free graphs
10:35-10:55 T. Klimošová Strong immersions in 4-edge connected graphs
11:05-11:25 P. Holub Packing chromatic number in outerplanar graphs with maximum degree 3
11:30-11:50 J. Kratochvíl Semi-mixed unit interval graphs
12:00-13:00 Lunch

Programme Committee

Petr Hliněný Stanislav Jendrol' Tomáš Kaiser Petr Kovář
Jan Kratochvíl Roman Nedela Jaroslav Nešetřil Zdeněk Ryjáček
Jozef Širáň Martin Škoviera