Program

MONDAY
	ROOM B	ROOM C	ROOM D	ROOM E
7:45-8:45	registration
8:45-9:00	opening of the conference
9:00-9:50	Noga Alon Graph-Codes: Problems, Results and Methods (room A in building D10)
9:50-10:35	coffee break
10:35-11:05	Jarosław Grytczuk Gauss words and rhythmic canons	Andrzej Grzesik Outdegree conditions forcing directed cycles	Anita Pasotti Shiftable Heffter Spaces	Robert Jajcay Connections between local regularity and symmetry in graphs
11:10-11:30	Mandy Lange-Geisler On the Orbital Chromatic Polynomial	Marek Skrzypczyk Antidirected paths in oriented graphs	Laura Johnson On relative simple Heffter spaces	Nacho López Lorenzo On bipartite biregular large graphs derived from difference sets
11:35-11:55	Sebastian Czerwiński Packing List-Colorings and the Proper Connection Number of Connected Graphs	Gaurav Kucheriya Unavoidable subgraphs in digraphs with large out-degrees	Sarah Lawson Further constructions of square integer relative Heffter arrays	James Tuite Networks with small excess
12:00-12:20	Marcin Anholcer On b-acyclic chromatic number of cubic and subcubic graphs	Clément Legrand-Duchesne Random embeddings of bounded degree trees with optimal spread	Marco Pellegrini Constructing magic objects	Valter Cingel Uniform routings of shortest paths in graphs with large automorphism groups
13:00-14:25	lunch
14:35-14:55	Zsolt Tuza Odd independent sets and strong odd colorings of graphs	Mike Henning Domination type parameters in 3-regular and 4-regular graphs (the talk starts at 14:25)	Paweł Prałat Zombies on the Grid(the talk starts at 14:25)	Primož Šparl Cubic vertex-transitive graphs with a symmetry-invariant 2-factor – a generalisation of the Generalised Petersen graphs
15:00-15:20	Rumki Ghosh Odd Coloring: Complexity and Algorithms	Peter Borg Isolation of graphs	David Gamarnik Sharp Thresholds Imply Circuit Lower Bounds	Maruša Lekše Cubic vertex-transitive graphs of girth seven
15:25-15:45	Masaki Kashima Odd coloring of k-trees	Magda Dettlaff 2-Domination edge subdivision in trees	Natalie Behague On random regular graphs and the Kim-Vu Sandwich Conjecture	Štefánia Glevitzká Cubic girth-regular graphs of girth six
15:45-16:20	coffee break
16:20-16:40	Elżbieta Turowska Quasi-majority neighbor sum distinguishing edge-colorings	Aleksandra Tepeh Induced cycles vertex number vs. (1,2)-domination in cubic graphs	Omer Angel Algebraic relations for permutons	Tatiana Jajcayova Asymmetric depth of graphs
16:45-17:05	Christoph Brause On the distinguishing chromatic number in hereditary graph classes	Soumyashree Rana Disjoint dominating and 2-dominating sets in graphs: Hardness and Approximation results	Peleg Michaeli Monochromatic matchings in almost-complete and random hypergraphs	Pavol Kollár How can graphs help us count?
17:10-17:30	Hanna Furmańczyk Packing coloring of graphs with long paths	Paras Vinubhai Maniya Paired versus double domination in forbidden graph classes	Markus Heydenreich Preferential attachment trees with vertex death
18:30-22:30	welcome dinner at Studio restaurant

TUESDAY
	ROOM B	ROOM C	ROOM D	ROOM E
9:00-9:50	Maria Axenovich Vertex sets in a hypercube: fair distribution and quick secret sharing. (room A in building D10)
9:50-10:35	coffee break
10:35-10:55	Martin Milanič Linear colorings of graphs(the talk starts at 10:25)	Oleg Pikhurko Constructions of Turán systems that are tight up to a multiplicative constant	Diane Donovan Embedding partial Latin squares in Latin squares with many mutually orthogonal mates	Roman Soták List strong edge-colouring
11:00-11:20	Pavol Hell Strong chordality in digraphs	Hilal Hama Karim On the Turán number of the expansion of the t-fan	Dean Crnković Switching operation for 2-designs and Hadamard matrices	Diana Švecová Normal edge coloring
11:25-11:45	Konstanty Junosza-Szaniawski Coloring Mixed Graphs	Magdalena Prorok Cycle lengths in graphs of given minimum degree	Simone Costa On the typical full automorphism group of Biembeddings of Archdeacon type	Robert Lukot’ka
11:50-12:10	Dieter Rautenbach A Faster Algorithm for Independent Cut	Ervin Győri Extremal problems on planar graphs	Stefano Della Fiore Graham’s rearrangement for a class of semidirect products	Makuochukwu Felix Oguagbaka Edge-uncoverability by four perfect matchings in cubic graphs
13:00-14:30	lunch
14:30-14:50	Ewa Drgas-Burchardt Interval colouring of oriented graphs	Laurentiu Ploscaru Distinct degrees and homogeneous sets in graphs	Andrzej Dudek Loose paths in random ordered hypergraphs	Paweł Bednarz On proper secondary and multiple dominating sets
14:55-15:15	Paweł Pękała List extensions of majority edge colourings	Ugo Giocanti Largest planar graphs of diameter 3 and fixed maximum degree	Andrzej Ruciński Homogeneous substructures in random ordered uniform matchings	Mateusz Pirga Perfect (1,2)-Dominating Sets in Graphs with a Few Large-Degree Vertices
15:20-15:40	Mateusz Kamyczura Majority Additive Coloring			Grzegorz Gutowski Complexity of Defensive Domination
15:40-16:20	coffee break
16:20-16:40	Bartosz Walczak On high-girth high-chromatic subgraphs of Burling graphs	Onur Agirseven On the Buratti-Horak-Rosa Conjecture for Small Supports	Jeannette Janssen Recovery of spatial vertex features in noisy SPA model graphs	Dragana Bozovic 2-Rainbow Independent Domination in Complementary Prisms
16:45-17:05	Piotr Micek Erdős-Pósa property of cycles that are far apart	Alex Pott On large Sidon sets	Patrick Bennett Packing edge-disjoint copies of a fixed graph in the random geometric graph	Boštjan Kuzman On rainbow domination regular graphs
17:10-17:30	Bartłomiej Bosek First-Fit Coloring of Forests in Random Arrival Model	Andrea Burgess Packing designs with large block size	Dawid Ignasiak Hitting times and the power of choice for random geometric graphs	Chiu-Yuan Chen An algorithmic proof for the domination number of grid graphs

WEDNESDAY
	ROOM B	ROOM C	ROOM D	ROOM E
9:30-11:30	sightseeing trip around Krakow by electric cart
14:30-15:20	Bojan Mohar Configuration space of 2-cell embeddings of graphs in surfaces and the Genus Log-Concavity Conjecture (room A in building D10)
15:20-16:00	coffee break
14:30-15:20	the session dedicated to Rafał Kalinowski birthday

THURSDAY
	ROOM B	ROOM C	ROOM D	ROOM E
9:00-9:50	Zdeněk Dvořák On fractional chromatic number and its approximations (room A in building D10)
9:50-10:35	coffee break
10:35-10:55	Alexandra Wesolek MIS on graphs excluding induced substructures(the talk starts at 10:25)	Gloria Rinaldi Exploring the Oberwolfach problem through solutions with non trivial automorphism group	Iztok Peterin Some recent results on modular product(the talk starts at 10:25)	Sylwia Cichacz Group distance magic cubic graphs
11:00-11:20	Amir Nikabadi Hitting all longest paths in hereditary graph classes	Tommaso Traetta An explicit lower bound on the largest cycle for the solvability of the Oberwolfach problem	Anna Lindeberg Construction of k-matchings in graph products	Ksenia Rozman Self-reverse distance magic labeling
11:25-11:45	Nadzieja Hodur K-Coloring (bull, chair)-free graphs	Alice Lacaze-Masmonteil On directed Oberwolfach problem with tables of even lengths	Julia Kozik Integrity of grids	Laurin Schwartze Pushing for Irregularity
11:50-12:10	Przemysław Gordinowicz On the optimality criteria of tree decompositions	Juliana Palmen Cycle decompositions of circulants C(n, {1, 3})	Riccardo Maffucci Planar and polyhedral graphs as Kronecker and Sierpiński products	Barbara Stołowska On rainbow caterpillars
13:00-14:30	lunch
14:35-14:55	Andrea Munaro Layered tree-independence number and clique-based separators(the talk starts at 14:25)	Dalibor Froncek G-designs for some graphs on seven edges	Ingo Schiermeyer 3-colourability, diamonds and butterflies(the talk starts at 14:25)	Jakub Kozik Line graph orientations and list edge colorings of regular graphs
15:00-15:20	Paweł Żyliński Algorithmically on vertices that belong to all, some and no minimum dominating set in a tree	Daniel Horsley On decomposition thresholds for odd-length cycles	Marta Borowiecka-Olszewska On Mycielskians of digraphs	Hubert Grochowski Computational and algebraic approaches to open XOR-magic graphs
15:25-15:45	Łukasz Kuszner Deterministic rendezvous with different maps	Lucia Marino Balanced generalized kite designs	María del Rocío Sánchez López H-kernels in 3-quasi-transitive digraphs	Shunichi Maezawa Sufficient forbidden immersion conditions for graphs to be 7-colorable
15:45-16:20	coffee break
16:20-16:40	Jakub Kwaśny List distinguishing index of graphs	Andrea Švob On some new regular digraphs from finite groups	Brett Kolesnik	Guillaume Scholz Representing Distance-Hereditary Graphs with Trees
16:45-17:05	Marcin Stawiski Irreducibility in distinguishing colourings	Paola Bonacini Gregarious hypergraph designs	Mindaugas Bloznelis Connectivity thresholds for superpositions of Bernoulli random graphs	Jadwiga Czyżewska On coarse tree decompositions and coarse balanced separators
19:00-23:00	banquet at Panorama Forum restaurant

FRIDAY
	ROOM B	ROOM C	ROOM D	ROOM E
9:00-9:50	Xuding Zhu Degree-truncated choice number of graphs (room A in building D10)
9:50-10:30	coffee break
10:30-10:50	Mohammad Hadi Shekarriz Soft Happy Colouring	Amanda Chafee Hamiltonian Cycles on Coverings	Maciej Cisiński Further progress on Wojda’s conjecture
10:55-11:15	Anna Flaszczyńska Totally Locally Irregular Decompositions of Graphs	Marco Galici Steiner triple systems with Veblen points	Kenta Ozeki A generalization of an ear decomposition and k-trees in highly connected star-free graphs
11:20-11:40	Igor Grzelec Weak and strong local irregularity of digraphs	Emma Smith Distinct Difference Configurations	Mark Korenblit Constructing algebraic expressions for lattice-structured digraphs
12:00-13:30	lunch

---