Common multiples of complete graphs and a 4-cycle
From MaRDI portal
Publication:1420608
DOI10.1016/j.disc.2002.11.001zbMath1030.05095OpenAlexW2065034775MaRDI QIDQ1420608
Peter J. Adams, Barbara M. Maenhaut, Darryn E. Bryant
Publication date: 2 February 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2002.11.001
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (5)
Least common multiple of graphs ⋮ Face 2-Colorable Embeddings with Faces of Specified Lengths ⋮ On graphs that have a unique least commonMultiple ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
- Exact coverings of 2-paths by 4-cycles
- Cycle decompositions of the line graph of \(K_ n\)
- Greatest common divisors and least common multiples of graphs
- Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\)
- Packing and Covering of the Complete Graph with 4-Cycles*
- COMMON MULTIPLES OF COMPLETE GRAPHS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Common multiples of complete graphs and a 4-cycle
