On equitably 2-colourable odd cycle decompositions

DOI10.1002/JCD.21937MaRDI QIDQ6584894zbMATH OpenFDO

Authors Andrea Burgess, Francesca Merola

Publication date 8 August 2024

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1002/JCD.21937

zbMATH Keywords

colourings of designscycle decompositionsequitable colourings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Equitably 2-colourable even cycle systems
• Some equitably 2-colourable cycle decompositions.
• scientific article; zbMATH DE number 5844277
• Some equitably 3-colourable cycle decompositions
• Some equitably 3-colorable cycle decompositions of K_v + 1

Cites work

• Coloring 4-cycle systems
• Colouring even cycle systems
• Completing the spectrum of almost resolvable cycle systems with odd cycle length
• Cycle decompositions of K_n and K_n-I
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• Cycle decompositions. V: Complete graphs into cycles of arbitrary lengths
• Equitably 2-colourable even cycle systems
• Equitably colored balanced incomplete block designs
• Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem
• Graceful labellings of paths
• Hamiltonian decomposition of Cayley graphs of degree 4
• scientific article; zbMATH DE number 1314686 (Why is no real title available?)
• scientific article; zbMATH DE number 5174848 (Why is no real title available?)
• scientific article; zbMATH DE number 3338396 (Why is no real title available?)
• On cycle systems with specified weak chromatic number
• On the Hamilton-Waterloo problem with odd orders
• Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
• Récréations mathématiques. 2e édition. Tome II.
• Some equitably 2-colourable cycle decompositions of multipartite graphs
• Some equitably 2-colourable cycle decompositions.
• Some equitably 3-colourable cycle decompositions
• Some equitably 3-colourable cycle decompositions of complete equipartite graphs
• The Oberwolfach problem and factors of uniform odd length cycles

Cited in

(1)

• Colourings of uniform group divisible designs and maximum packings

This page was built for publication: On equitably 2-colourable odd cycle decompositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584894)