Decomposing complete equipartite graphs into closed trails of length k

DOI10.1007/S00373-010-0899-8zbMATH Open1231.05218OpenAlexW2068528849MaRDI QIDQ604659FDOQ604659

Authors: 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

Recommendations

• Closed trail decompositions of complete equipartite graphs
• 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
• Decompositions of complete multigraphs into open trails

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)

Cites Work

• Balanced incomplete block designs and related designs
• Packing circuits into \(K_N\).
• Decomposition of Complete Bipartite Even Graphs into Closed Trails
• Neighbor designs
• Decomposing complete equipartite graphs into cycles of length2p
• Title not available (Why is that?)
• Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
• Complete equipartite \(3p\)-cycle systems
• Decomposing complete tripartite graphs into closed trails of arbitrary lengths
• Title not available (Why is that?)

Cited In (6)

• Closed trail decompositions of complete equipartite graphs
• Sparse graphs which decompose into closed trails of arbitrary lengths
• Decomposition of complete equipartite graphs into paths and cycles of length \(2p\)
• Closed trail decompositions of some classes of regular graphs
• Decomposing complete multipartite graphs into closed trails of arbitrary even lengths
• Title not available (Why is that?)

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

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