Preliminary programme

The conference starts on Monday 30th May 2016 at 12:30 with lunch and finishes on Friday 3th June 2016 at 12:00 with lunch. The conference trip takes place on Wednesday; in each of the remaining half-days, there will be one invited lecture and several ordinary lectures.

The abstracts of the talks are available in the abstract booklet.

Monday 30th May

12:30-14:00 lunch
14:20-14:30 conference opening
14:30-15:20 J. Przybylo Asymptotically optimal neighbour distinguishing edge colourings of graphs
15:20-15:40 coffee break
15:40-16:00 T. Madaras On improper interval edge colourings
16:05-16:25 M. Maceková Families of plane graphs with prescribed δ, ρ, w and w*
16:35-16:55 M. Sabová Minimal unavoidable sets of cycles in polyhedral graphs
17:00-17:30 J. Valiska (R,M)-WORM colorings of plane graphs
18:30-19:30 dinner
19:30- welcome party

Tuesday 31st May

8:00-9:00 breakfast
9:00-9:50 M. Stehlík Topological bounds on the chromatic number
9:50-10:10 coffee break
10:10-10:30 P. Czimmermann An alternative representation of symmetries in graphs and networks
10:35-10:55 T. Jajcayová Combinatorial structures with regular automorphism groups
11:05-11:25 K. Hriňáková Möbius regular maps on the group PSL(2, q)
11:30-11:50 R. Nedela Vertex-partitions of cubic graphs and cyclic connectivity
11:55-12:15 P. Gregor Trimmed Gray codes
12:15-13:15 lunch
15:00-15:50 I. Fabrici Colorings of plane graphs
15:50-16:10 coffee break
16:10-16:30 Ch. Rubio-Montiel The achromatic and Grundy numbers of Kneser graphs
16:35-16:55 M. Janicová Homogeneous colouring
17:05-17:25 M. Mockovčiaková On the cold cases in incidence coloring
17:30-17:50 R. Soták On incidence colorings of graphs
18:30-19:30 dinner

Wednesday 1st June

8:00-9:00 breakfast
9:00-9:50 J. Hladký Tilings in graphons
9:50-10:10 coffee break
10:10-10:30 E. Rollová Flows on signed graphs with two negative edges
10:35-10:55 M. Knor Graphs with the minimum value of Balaban index
11:05-11:25 M. Klešč Join products and Cartesian products crossing numbers
11:30-12:30 lunch
12:30-19:00 conference trip
19:00-20:00 dinner

Thursday 2nd June

8:00-9:00 breakfast
9:00-9:50 P. Kolman From Length Bounded Cut Problem to Extended Formulations for MSOL Problems on Graphs of Bounded Treewidth
9:50-10:10 coffee break
10:10-10:30 A. Silber Antimagic labelings of trees with vertices of degree two only on paths of a fixed length
10:35-10:55 Matej Krbecek The minimization of the maximal out-degree in a simple graph
11:05-11:25 M. Pokorný The inertia and D-energy of distance matrices of some H-join graphs
11:30-11:50 J. Ekstein Connected even factors in the square of 2-edge-connected graphs
12:00-13:00 lunch
15:00-15:50 J. Šiagiová A survey on Cayley graphs in the degree-diameter problem
15:50-16:10 coffee break
16:10-16:30 M. Abas Large Cayley graphs of diameter two
16:35-16:55 K. Berčič A central repository of discrete objects
17:05-17:25 S. Filipovski On the excess of vertex-transitive graphs of given degree and girth
17:30-17:50 V. Hucíková On external symmetries of Wilson’s maps
19:00- conference dinner

Friday 3th June

8:00-9:00 breakfast
9:00-9:50 Š. Gyürki From strongly regular graphs to directed strongly regular graphs
9:50-10:10 coffee break
10:10-10:30 A. Kabela 10-tough chordal graphs are Hamiltonian
10:35-10:55 J. Karabáš Algorithms for regular 3-edge-colouring of subcubic graphs
11:05-11:25 P. Vrána On hamiltonicity of {K1,4 , K1,4 + e, S(2, 1, 1)}-free graphs
11:30-11:50 A. Dresslerová L(2,1)-labelling of cacti
12:00-13:00 lunch

Programme committee

Chair: Martin Škoviera


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