The workshop takes place on 12-14 August. The dinner is planned for Tuesday 13 August at the restaurant Pakhuis. On Thursday 15 August, we organise an optional trip to Bruges as a social activity.

The booklet containing the abstracts and other practical information is also available to download. Note that every participant will receive a printed copy, so there is no need to print this yourself.

Monday 12 August

09h00 - 09h30 Badge pick-up
09h30 - 09h35 Opening
09h35 - 10h20 Detecting odd holes
Maria Chudnovsky
10h20 - 10h35 Coffee break
10h35 - 11h00 Forbidden pairs and perfect graphs
Adam Kabela
11h00 - 11h25 Large independent sets in triangle-free subcubic graphs
Gwenaël Joret
11h25 - 11h50 The 1–2–3 conjecture almost almost holds for regular graphs
Jakub Przybyło
11h50 - 12h15 Component factors of simple edge-chromatic critical graphs
Eckhard Steffen
12h15 - 14h00 Lunch
14h00 - 14h25 4-connected polyhedra have at least a linear number of hamiltonian cycles
Gunnar Brinkmann
14h25 - 14h50 Using Tutte paths for finding long cycles in planar graphs
Andreas Schmid
14h50 - 15h15 Circumference of essentially 4-connected planar graphs
Igor Fabrici
15h15 - 15h30 Coffee break
15h30 - 15h55 X-minors and X-spanning subgraphs
Samuel Mohr
15h55 - 16h20 Non-bipartite regular 2-factor isomorphic graphs: an update
Domenico Labbate
16h20 - 16h45 Faithful subgraphs and hamiltonian circles of infinite graphs
Binlong Li

Tuesday 13 August

09h30 - 10h15 Graphs with specified degrees
Brendan McKay
10h15 - 10h35 Coffee break
10h35 - 11h00 Diagonal conjecture for classical Ramsey numbers
Stanisław Radziszowski
11h00 - 11h25 Generating graph and matroid minors
Sandra Kingan
11h25 - 11h50 Combinatorial generation via permutation languages
Torsten Mütze
11h50 - 12h15 Combinatorial objects as hereditarily finite sets and algorithmic applications
Pascal Schweitzer
12h15 - 14h00 Lunch
14h00 - 14h45 Crossing-critical graphs
Bojan Mohar
14h45 - 15h10 Superposition of snarks revisited
Martin Škoviera
15h10 - 15h35 Lower bound on the length of a cycle cover of a cubic graph
Edita Máčajová
15h35 - 16h00 Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks
Giuseppe Mazzuoccolo
19h00 - 22h00 Conference dinner

Wednesday 14 August

09h30 - 10h15 The maximal abstract 3-rigidity matroid
Bill Jackson
10h15 - 10h35 Coffee break
10h35 - 11h00 On the 4-color theorem for signed graphs
František Kardoš
11h00 - 11h25 3-coloring of claw-free graphs
Mária Maceková
11h25 - 11h50 Polynomial χ-binding functions and forbidden induced subgraphs — a survey
Ingo Schiermeyer
11h50 - 12h15 The stable set problem in graphs with bounded genus and bounded odd cycle packing number
Samuel Fiorini
12h15 - 14h00 Lunch
14h00 - 14h25 Complete acyclic colorings
Raphael Steiner
14h25 - 14h50 Compact cactus representations of all non-trivial min-cuts
On-Hei Solomon Lo
14h50 - 15h15 Minimum leaf number of 2-connected cubic graphs
Márton Dücső
15h15 - 15h40 Extremal results on the eccentric connectivity index
Pierre Hauweele
15h40 - 15h45 Closing remarks