Closed trail decompositions of some classes of regular graphs
From MaRDI portal
Publication:764903
DOI10.1016/j.disc.2011.12.015zbMath1237.05169OpenAlexW2074609888MaRDI QIDQ764903
Publication date: 16 March 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.12.015
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (4)
\(2p\)-cycle decompositions of some regular graphs and digraphs ⋮ Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6 ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- A method in graph theory
- Balanced incomplete block designs and related designs
- Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
- Decompositions of complete multipartite graphs into cycles of even length
- Resolvable even cycle decompositions of the tensor product of complete graphs
- \(C_7\)-decompositions of the tensor product of complete graphs
- \(C_{p}\)-decompositions of some regular graphs
- Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles
- A note on Hamiltonian circuits
- Packing Circuits into KN
- Closed trail decompositions of complete equipartite graphs
- Decomposing complete tripartite graphs into closed trails of arbitrary lengths
- Packing Digraphs with Directed Closed Trails
- Cycle decompositions of complete multigraphs
- Cycle decompositions of complete multigraphs
- A textbook of graph theory
This page was built for publication: Closed trail decompositions of some classes of regular graphs
