Programme
The conference takes place on 9-11 July 2025. On Thursday, the conference dinner is planned at the restaurant Le Mess.
The booklet containing the abstracts is available to download.
Wednesday 9 July
| 09h00 - 09h25 | Badge pick-up |
| 09h25 - 09h30 | Opening remarks |
| 09h30 - 10h20 | Tree decompositions meet induced matchings Martin Milanic |
| 10h20 - 10h45 | Coffee break |
| 10h45 - 11h10 | On Gyárfás’ Path-Colour Problem Ben Cameron |
| 11h10 - 11h35 | 200,000 colors suffice (for t-perfect graphs) Linda Cook |
| 11h35 - 12h00 | Burling graphs and where to find them Paweł Rzążewski |
| 12h00 - 14h00 | Lunch break (suggestions of lunch places) |
| 14h00 - 14h25 | Generating maps the naïve way Gunnar Brinkmann |
| 14h25 - 14h50 | Generation of vertex-girth-regular graphs Jorik Jooken |
| 14h50 - 15h15 | Complete polyhedral description of chemical graphs of maximum degree at most 3 Alain Hertz |
| 15h15 - 15h40 | Coffee break |
| 15h40 - | Open Problem Session |
Thursday 10 July
| 09h30 - 10h20 | Trigraphs and dense neighborhood lemmas Stéphan Thomassé |
| 10h20 - 10h45 | Coffee break |
| 10h45 - 11h10 | 3-Colouring Planar Graphs Vida Dujmović |
| 11h10 - 11h35 | Spanning plane subgraphs of 1-plane graphs Kenta Noguchi |
| 11h35 - 12h00 | Beyond Negami's Planar Cover Conjecture Jane Tan |
| 12h00 - 14h00 | Lunch break |
| 14h00 - 14h25 | Cycle covers of cubic graphs with defect 3, and beyond Martin Škoviera |
| 14h25 - 14h50 | Uniquely Normal Graphs Giuseppe Mazzuoccolo |
| 14h50 - 15h15 | Berge conjecture for generalised cycle permutation graphs Edita Máčajová |
| 15h15 - 15h40 | Coffee break |
| 15h40 - 16h05 | Infinite induced-saturated graphs Carla Groenland |
| 16h05 - 16h30 | Periodic colorings and orientations Louis Esperet |
| 16h30 - 16h55 | The Pairing-Hamiltonian property in graph prisms Marién Abreu |
| 18h30 - | Conference dinner |
Friday 11 July
| 09h30 - 10h20 | Separation systems of subdivisions Maya Stein |
| 10h20 - 10h45 | Coffee break |
| 10h45 - 11h10 | What is the fewest independent sets a triangle-free graph can have? Ross Kang |
| 11h10 - 11h35 | Fractional chromatic number vs. Hall ratio Raphael Steiner |
| 11h35 - 12h00 | Improved bounds for the minimum degree of minimal Ramsey graphs Sam Mattheus |
| 12h00 - 14h00 | Lunch break |
| 14h00 - 14h25 | Odd Colorings of Graphs Torsten Ueckerdt |
| 14h25 - 14h50 | On linearly ordered colourings of hypergraphs Karolina Okrasa |
| 14h50 - 15h15 | Erdős-Pósa property of cycles that are far apart Piotr Micek |
| 15h15 - 15h40 | Coffee break |
| 15h40 - 16h05 | Spectral properties of hexagonal tilings of the torus Primož Potočnik |