Sparse graphs which decompose into closed trails of arbitrary lengths

DOI10.1007/s00373-008-0783-yzbMath1204.05073OpenAlexW2016437900MaRDI QIDQ1015428

Nicholas J. Cavenagh, Elizabeth J. Billington

Publication date: 8 May 2009

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-008-0783-y

zbMATH Keywords

sparse graphsgraph decompositionsclosed trails

Mathematics Subject Classification ID

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

Related Items

Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6, Unnamed Item, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Packing closed trails into dense graphs.
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Packing Circuits into K_N
• Cycle decompositions III: Complete graphs and fixed length cycles
• Decomposing complete tripartite graphs into closed trails of arbitrary lengths
• Decomposition of Complete Bipartite Even Graphs into Closed Trails