Closed trail decompositions of complete equipartite graphs

DOI10.1002/JCD.20228MaRDI QIDQ3578148zbMATH OpenOpenAlexFDO

Authors Mateja Šajna, Andrea 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

zbMATH Keywords

closed trailcomplete multipartite graphdecomposition

Mathematics Subject Classification ID

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

Recommendations

• Decomposing complete equipartite graphs into closed trails of length \(k\)
• Closed trail decompositions of some classes of regular graphs
• Decomposing complete tripartite graphs into closed trails of arbitrary lengths
• On complete tripartite graphs arbitrarily decomposable into closed trails
• Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts

Cites work

• Another class of balanced graph designs: Balanced circuit designs
• Balanced incomplete block designs and related designs
• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
• Decomposing complete equipartite graphs into closed trails of length \(k\)
• Decomposing complete equipartite graphs into cycles of length2p
• Decomposing complete tripartite graphs into closed trails of arbitrary lengths
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• Decomposition of Complete Bipartite Even Graphs into Closed Trails
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Edge partitions of complete multipartite graphs into equal length circuits
• scientific article; zbMATH DE number 3675916 (Why is no real title available?)
• scientific article; zbMATH DE number 1343531 (Why is no real title available?)
• scientific article; zbMATH DE number 3428942 (Why is no real title available?)
• Maximal consistent families of triples
• Maximum packings of uniform group divisible triple systems
• On decomposing K_n -I into cycles of a fixed odd length
• Packing circuits into K_N.
• Packing Digraphs with Directed Closed Trails
• The equipartite Oberwolfach problem with uniform tables
• The Existence and Construction of Balanced Incomplete Block Designs

Cited in

(10)

• On planar graphs arbitrarily decomposable into closed trails
• Decomposing complete multipartite graphs into closed trails of arbitrary even lengths
• scientific article; zbMATH DE number 5917766 (Why is no real title available?)
• Decomposing complete tripartite graphs into closed trails of arbitrary lengths
• scientific article; zbMATH DE number 653256 (Why is no real title available?)
• Odd decompositions of Eulerian graphs
• Decomposition of complete bipartite digraphs and even complete multigraphs into closed trails
• On complete tripartite graphs arbitrarily decomposable into closed trails
• Decomposing complete equipartite graphs into closed trails of length \(k\)
• Closed trail decompositions of some classes of regular graphs

This page was built for publication: Closed trail decompositions of complete equipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578148)