On decomposing \(K_n -I\) into cycles of a fixed odd length

DOI10.1016/S0012-365X(01)00099-1zbMath0992.05063OpenAlexW2024890934MaRDI QIDQ1349111

Mateja Šajna

Publication date: 21 May 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00099-1

zbMATH Keywords

decompositioncyclescomplete graph

Mathematics Subject Classification ID

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

Related Items (12)

Face 2-Colorable Embeddings with Faces of Specified Lengths ⋮ Decomposing various graphs into short even-length cycles ⋮ Primitive cycle decompositions of Kn and Kn−I ⋮ Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph ⋮ Embedding partial odd-cycle systems in systems with orders in all admissible congruence classes ⋮ Closed trail decompositions of complete equipartite graphs ⋮ Almost resolvable cycle systems-an analogue of Hanani triple systems ⋮ A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv ⋮ Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd ⋮ Cycle decompositions of complete multigraphs ⋮ Cycle decompositions of complete multigraphs ⋮ Decomposition of the Kneser graph into paths of length four

This page was built for publication: On decomposing \(K_n -I\) into cycles of a fixed odd length