CSD11 :: Programme

10:00 – 13:00 🛬 Arrival & registration 📝
13:45 – 14:00 🎤 Opening remarks 🎤
Session chair: Primož Potočnik
14:00 – 14:50 Tatiana Jajcayová: Computational aspects of interplay between global and local symmetries 📽
14:50 – 15:15 Ján Pastorek: Extremely asymmetric graphs and partial automorphisms 📽
15:15 – 15:40 Jörg Arndt: A curious family of point-covering, plane-filling curves
15:40 – 16:10 ☕ Coffee break 🥐
16:10 – 16:35 Pavol Kollár: How symmetric do you wish your graph to be? 📽
16:35 – 17:00 Oscar Jocqué: Symmetry-preserving operations and the genus of graphs 📽
17:00 – 17:25 Robert Jajcay: Searching for hypergraphs with prescribed regular automorphism groups of small orders 📽
17:25 – 17:30 Conference photo
20:00 – ∞ 🤝 Reception 🤗

09:00 – 09:05 📢 Announcements 📢
Session chair: Hadrien Mélot
09:05 – 09:55 Jan Goedgebeur: An introduction to computational graph theory and generation algorithms 📩
09:55 – 10:20 Gauvain Devillez: Knowledge management in House of Graphs 📽
10:20 – 10:45 Katja Berčič: Collections of mathematical objects
10:45 – 11:15 ☕ Coffee break ☕
11:15 – 11:40 Michiel Provoost: What makes a graph interesting? 📽
11:40 – 12:05 Anthony Labarre: graphotaxy: A graph classification system 📽
12:05 – 12:30 Ivan Damnjanović: Reinforcement learning meets graph theory: A new framework
12:30 – 14:00 🎧 Free time 🍕
Session chair: Jan Goedgebeur
14:00 – 14:50 Milica Anđelić: From equitable partitions to full spectra: A framework for symmetric graphs
14:50 – 15:15 Ksenija Rozman: Nut graphs with two vertex and three edge orbits
15:15 – 15:40 Irene Sciriha: Walks and nut graphs in uniform threshold hypergraphs 📩
15:40 – 16:10 ☕ Coffee break 🥐
16:10 – 16:35 James L. Borg: Distinct vertex-edge spectral labelling for threshold graphs 📩
16:35 – 17:00 Akbar Davoodi: Metric dimension of some structured graph families: Exact values and explicit bases
17:00 – 17:25 Matúš Matok: Total colouring of Halin graphs

09:00 – 09:05 📢 Announcements 📢
Session chair: Marién Abreu
09:05 – 09:55 Hadrien Mélot: A polyhedral journey through extremal chemical graphs
09:55 – 10:20 Elizabeth J. Hartung: The p-anionic Clar structures of a fullerene
10:20 – 10:45 Cate S. Anstöter: Predicting lifetimes of metastable anions: A mathematical–chemical approach
10:45 – 11:15 ☕ Coffee break ☕
11:15 – 11:40 Patrick W. Fowler: An example of graph theory in molecular design: polyhedral carbon-nitrogen cages 📩
11:40 – 12:05 Maxine M. McCarthy: Finding and enumerating abnormal digraphs 📩
12:05 – 12:30 Craig Eric Larson: Maximum nullity of benzenoid graphs
14:00 – 18:30 🐐 Excursion 🚠
19:30 – ∞ 🍄 Conference dinner 🦐

09:00 – 09:05 📢 Announcements 📢
Session chair: Milica Anđelić
09:05 – 09:55 Marién Abreu: Factors and hamiltonicity in regular graphs
09:55 – 10:20 Valentin Dusollier: PHOEG Again?! Yes, but this time we're catching Al Capone!
10:20 – 10:45 Bang C. Huynh: Rust-based symbolic framework for symmetry in quantum chemistry
10:45 – 11:15 ☕ Coffee break ☕
11:15 – 11:40 Richard Golnik: Autocatalytic cores in reaction networks with explicit catalysis
11:40 – 12:05 Evgeny Spodarev: Spectral properties of large fullerenes, graphene and nanotubes
12:05 – 12:30 Henryk Witek: Computer-assisted determination of stability of chemical compounds
12:30 – 14:00 🎧 Free time 🍕
Session chair: Tatiana Jajcayová
14:00 – 14:50 Marston Conder: Constructing databases of discrete objects with a high degree of symmetry
14:50 – 15:15 Martin Bachratý: Computation and conjectures: skew morphisms of finite cyclic groups
15:15 – 15:40 Tomaž Pisanski: LCF codes for chemical graphs
15:40 – 16:10 ☕ Coffee break 🥐
16:10 – 16:35 Martin Mačaj: On r-regular families of permutations
16:35 – 17:00 Maruša Lekše: Self separable sets
17:00 – 17:25 Boštjan Kuzman: Fractional matching extendability of Cayley graphs of Abelian groups

09:00 – 09:05 📢 Announcements 📢
Session chair: Marston Conder
09:05 – 09:30 Steven Van Overberghe: Algorithms for the generation of snarks
09:30 – 09:55 Antonio Montero: Faithfulness in maniplexes
09:55 – 10:20 Andrés David Santamaria Galvis: Constructing partitioning schemes for d-dimensional manifolds
10:20 – 10:45 Nino Bašić: ILP/CP‑SAT does it again: Construction of d‑regular nut graphs with practical efficiency
10:45 – 11:15 ☕ Coffee break ☕
11:15 – 12:00 Concluding remarks & discussion

Book of Abstracts