Decomposing complete equipartite graphs into closed trails of length k
From MaRDI portal
Publication:604659
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
Cites work
- Balanced incomplete block designs and related designs
- Complete equipartite 3p-cycle systems
- 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
- scientific article; zbMATH DE number 1229616 (Why is no real title available?)
- scientific article; zbMATH DE number 1308953 (Why is no real title available?)
- Neighbor designs
- Packing circuits into K_N.
- Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
Cited in
(6)- Sparse graphs which decompose into closed trails of arbitrary lengths
- Decomposition of complete equipartite graphs into paths and cycles of length 2p
- Decomposing complete multipartite graphs into closed trails of arbitrary even lengths
- Closed trail decompositions of complete equipartite graphs
- scientific article; zbMATH DE number 653256 (Why is no real title available?)
- Closed trail decompositions of some classes of regular graphs
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)