Cycle systems of the line graph of the complete graph
From MaRDI portal
Publication:4865525
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199602)21:2<173::AID-JGT6>3.0.CO;2-O" /><173::AID-JGT6>3.0.CO;2-O 10.1002/(SICI)1097-0118(199602)21:2<173::AID-JGT6>3.0.CO;2-OzbMath0840.05068OpenAlexW2083988493MaRDI QIDQ4865525
Publication date: 25 February 1996
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199602)21:2<173::aid-jgt6>3.0.co;2-o
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (8)
Covering 2-paths uniformly ⋮ Unnamed Item ⋮ 4-cycle systems of \(K_n-E(F^\ast)\) ⋮ Graphs as navigational infrastructure for high dimensional data spaces ⋮ 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
This page was built for publication: Cycle systems of the line graph of the complete graph