Closed trail decompositions of complete equipartite graphs
From MaRDI portal
Publication:3578148
DOI10.1002/jcd.20228zbMath1222.05209OpenAlexW2108238762MaRDI QIDQ3578148
Mateja Šajna, Andrea C. Burgess
Publication date: 13 July 2010
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.20228
Related Items (3)
Decomposing complete multipartite graphs into closed trails of arbitrary even lengths ⋮ Odd Decompositions of Eulerian Graphs ⋮ Closed trail decompositions of some classes of regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposing complete equipartite graphs into closed trails of length \(k\)
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Another class of balanced graph designs: Balanced circuit designs
- Edge partitions of complete multipartite graphs into equal length circuits
- Balanced incomplete block designs and related designs
- On decomposing \(K_n -I\) into cycles of a fixed odd length
- Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
- Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
- The equipartite Oberwolfach problem with uniform tables
- Packing Circuits into KN
- The Existence and Construction of Balanced Incomplete Block Designs
- Decomposing complete equipartite graphs into cycles of length2p
- Decomposing complete tripartite graphs into closed trails of arbitrary lengths
- Maximum packings of uniform group divisible triple systems
- Packing Digraphs with Directed Closed Trails
- Decomposition of Complete Bipartite Even Graphs into Closed Trails
- Maximal consistent families of triples
This page was built for publication: Closed trail decompositions of complete equipartite graphs
