On equitably 2-colourable odd cycle decompositions

DOI10.1002/JCD.21937zbMATH Open1544.05082MaRDI QIDQ6584894

Andrea Burgess, Francesca Merola

Publication date: 8 August 2024

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

zbMATH Keywords

cycle decompositionsequitable colouringscolourings of designs

Mathematics Subject Classification ID

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

Cites Work

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

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)