Newi-Perfect Cycle Decompositions via Vertex Colorings of Graphs
From MaRDI portal
Publication:2957063
DOI10.1002/jcd.21511zbMath1354.05070OpenAlexW2258081957MaRDI QIDQ2957063
Simone Costa, Xiao Miao Wang, Marco Buratti
Publication date: 20 January 2017
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.21511
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Almost 2-perfect 8-cycle systems ⋮ New 2-designs from strong difference families ⋮ Frame difference families and resolvable balanced incomplete block designs
Cites Work
- Unnamed Item
- Unnamed Item
- The spectrum for 2-perfect 6-cycle systems
- 2-perfect \(m\)-cycle systems
- \(i\)-perfect \(m\)-cycle systems, \(m\leq 19\)
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Decomposing complete equipartite graphs into short odd cycles
- Some constructions for cyclic perfect cycle systems
- Cycle decompositions III: Complete graphs and fixed length cycles
- Decomposing complete equipartite graphs into short even cycles
- Doubly transitive 2-factorizations
- Strong difference families over arbitrary graphs
- The strong chromatic number of a graph
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
- Some Results on 1‐Rotational Hamiltonian Cycle Systems
This page was built for publication: Newi-Perfect Cycle Decompositions via Vertex Colorings of Graphs