Maximum packings with odd cycles

DOI10.1016/0012-365X(94)90375-1zbMath0806.05055MaRDI QIDQ1332431

Saad I. El-Zanati

Publication date: 29 August 1994

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

zbMATH Keywords

decompositionpackingodd cycle systems

Mathematics Subject Classification ID

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

Related Items (5)

Maximum packings of the complete graph with uniform length cycles ⋮ Almost resolvable maximum packings of complete graphs with 5-cycles ⋮ \(d\)-cube decompositions of \(K_n\setminus K_m\) ⋮ Cycle decompositions III: Complete graphs and fixed length cycles ⋮ Cycle packings of the complete multigraph

Cites Work

• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Packing pentagons into complete graphs: How clumsy can you get?
• On the construction of odd cycle systems
• Decomposing Complete Graphs Into Cycles of Length 2P
• On the cyclic decompositions of the complete graph into polygons with odd number of edges
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximum packings with odd cycles