Cycle systems of the line graph of the complete graph
From MaRDI portal
DOI10.1002/(SICI)1097-0118(199602)21:2%3C173::AID-JGT6%3E3.0.CO;2-OzbMATH Open0840.05068OpenAlexW2083988493MaRDI QIDQ4865525FDOQ4865525
Authors: B. A. Cox, C. A. Rodger
Publication date: 25 February 1996
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199602)21:2%3C173::aid-jgt6%3E3.0.co;2-o
Recommendations
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (10)
- A \(C_5\)-decomposition of the \(\lambda\)-fold line graph of the complete graph
- Covering 2-paths uniformly
- Packings and coverings of lambda-fold line graphs of the complete graph with \(k\)-cycles, for \(k=4,6\)
- Multidecompositions of line graphs of complete graphs
- Maximum packing and minimum covering of the line graph of the complete graph with kite
- Graphs as navigational infrastructure for high dimensional data spaces
- Title not available (Why is that?)
- 4-cycle systems of \(K_n-E(F^\ast)\)
- Cycle decompositions of the line graph of \(K_ n\)
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4865525)