Cycle decompositions of the line graph of \(K_ n\)

DOI10.1016/0097-3165(93)90078-MzbMath0777.05076OpenAlexW1990180003MaRDI QIDQ1208048

C. A. Rodger, M. Colby

Publication date: 16 May 1993

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(93)90078-m

zbMATH Keywords

line graphcycle decomposition

Mathematics Subject Classification ID

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

Related Items (9)

Embedding coverings of 2-paths with 3-paths ⋮ Covering 2-paths uniformly ⋮ Unnamed Item ⋮ Common multiples of complete graphs and a 4-cycle ⋮ 4-cycle systems of \(K_n-E(F^\ast)\) ⋮ Unnamed Item ⋮ Multidecompositions of line graphs of complete graphs ⋮ A \(C_5\)-decomposition of the \(\lambda\)-fold line graph of the complete graph ⋮ Decompositions of line graphs of complete graphs into paths and cycles

Cites Work

• Exact coverings of 2-paths by 4-cycles
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k

This page was built for publication: Cycle decompositions of the line graph of \(K_ n\)