Open problems of the 32nd Workshop on Cycles and Colourings
Preprint
Abstract
Since its beginnings, every Cycles and Colourings workshop holds one or two open problem sessions; this document contains the problems (together with notes regarding the current state of the art and related bibliography) presented by participants of the 32nd edition of the workshop which took place in Poprad, Slovakia during September 8-13, 2024 (see the workshop webpage https://candc.upjs.sk).Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Packing Colourings in Complete Bipartite Graphs and the Inverse Problem for Correspondence PackingJournal of Graph Theory, 2025
- List packing number of bounded degree graphsCombinatorics, Probability and Computing, 2024
- Packing list‐coloringsRandom Structures & Algorithms, 2023
- Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular GraphsSIAM Journal on Discrete Mathematics, 2023
- Crumby colorings — Red-blue vertex partition of subcubic graphs regarding a conjecture of ThomassenDiscrete Mathematics, 2022
- Factorizing regular graphsJournal of Combinatorial Theory, Series B, 2020
- The square of a planar cubic graph is 7-colorableJournal of Combinatorial Theory, Series B, 2018
- Extended Petersen graphsDiscrete Mathematics, 2005
- Indecomposable r‐graphs and some other counterexamplesJournal of Graph Theory, 1999
- Regular n-valent n-connected nonHamiltonian non-n-edge-colorable graphsJournal of Combinatorial Theory, Series B, 1973