Decomposing complete equipartite graphs into closed trails of length \(k\)

DOI10.1007/s00373-010-0899-8zbMath1231.05218OpenAlexW2068528849MaRDI QIDQ604659

Benjamin R. Smith

Publication date: 12 November 2010

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

Full work available at URL: https://doi.org/10.1007/s00373-010-0899-8

zbMATH Keywords

graph decompositionequipartite graphclosed trails

Mathematics Subject Classification ID

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

Related Items (3)

Decomposing complete multipartite graphs into closed trails of arbitrary even lengths ⋮ Closed trail decompositions of complete equipartite graphs ⋮ Closed trail decompositions of some classes of regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
• Balanced incomplete block designs and related designs
• Neighbor designs
• Packing Circuits into K_N
• Decomposing complete equipartite graphs into cycles of length2p
• Decomposing complete tripartite graphs into closed trails of arbitrary lengths
• Decomposition of Complete Bipartite Even Graphs into Closed Trails

This page was built for publication: Decomposing complete equipartite graphs into closed trails of length \(k\)