Resolvable even cycle decompositions of the tensor product of complete graphs
From MaRDI portal
Publication:2275406
DOI10.1016/j.disc.2011.04.028zbMath1223.05238OpenAlexW1981752702MaRDI QIDQ2275406
Publication date: 8 August 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.04.028
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)
Related Items (5)
\(2p\)-cycle decompositions of some regular graphs and digraphs ⋮ Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6 ⋮ $C_4$-decomposition of the tensor product of complete graphs ⋮ Unnamed Item ⋮ Closed trail decompositions of some classes of regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The solution of the bipartite analogue of the Oberwolfach problem
- Factorizations of product graphs into cycles of uniform length
- The Oberwolfach problem and factors of uniform odd length cycles
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- The equipartite Oberwolfach problem with uniform tables
- \(C_7\)-decompositions of the tensor product of complete graphs
- \(C_{p}\)-decompositions of some regular graphs
- Cycle decompositions III: Complete graphs and fixed length cycles
- Resolvable modified group divisible designs with block size three
- On the construction of odd cycle systems
- Decomposing complete equipartite graphs into cycles of length2p
- A textbook of graph theory
This page was built for publication: Resolvable even cycle decompositions of the tensor product of complete graphs