Decomposing complete equipartite graphs into closed trails of length \(k\)
From MaRDI portal
Publication:604659
DOI10.1007/s00373-010-0899-8zbMath1231.05218MaRDI QIDQ604659
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
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Closed trail decompositions of some classes of regular graphs, Decomposing complete multipartite graphs into closed trails of arbitrary even lengths, Closed trail decompositions of complete equipartite 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 KN
- 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