\(2p\)-cycle decompositions of some regular graphs and digraphs
From MaRDI portal
Publication:1637135
DOI10.1016/j.disc.2018.04.022zbMath1388.05156OpenAlexW2805227059MaRDI QIDQ1637135
Publication date: 7 June 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.04.022
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)
Related Items (2)
Cites Work
- Hamilton cycle decompositions of the tensor products of complete bipartite graphs and complete multipartite graphs
- Closed trail decompositions of some classes of regular graphs
- Directed Hamilton cycle decompositions of the tensor products of symmetric digraphs
- Hamilton cycle decompositions of the tensor product of complete multipartite graphs
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Decompositions of the Kronecker product of a cycle and a path into long cycles and long paths
- Modified group divisible designs with block size 4 and \(\lambda=1\)
- An application of modified group divisible designs
- On Hamilton cycle decompositions of the tensor product of complete graphs
- Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
- Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- 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
- \(C_{4p}\)-frame of complete multipartite multigraphs
- Cycle decompositions III: Complete graphs and fixed length cycles
- Cycle Frames of Complete Multipartite Multigraphs - III
- Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd
- On the construction of odd cycle systems
- Decomposing complete equipartite graphs into cycles of length2p
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
- Cycle decompositions V: Complete graphs into cycles of arbitrary lengths
- A Complete Solution to the Existence of ‐Cycle Frames of Type
- Cycle Decompositions of $K_{\lowercase{n,n}}-I$
- A textbook of graph theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: \(2p\)-cycle decompositions of some regular graphs and digraphs