Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6
From MaRDI portal
Publication:2214321
DOI10.7151/dmgt.2178zbMath1453.05104OpenAlexW2901396299WikidataQ128936840 ScholiaQ128936840MaRDI QIDQ2214321
Publication date: 8 December 2020
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2178
Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \((4, 5)\)-cycle systems of complete multipartite graphs
- Decompositions of complete multigraphs into cycles of varying lengths
- 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
- Sparse graphs which decompose into closed trails of arbitrary lengths
- Balanced incomplete block designs and related designs
- Decomposing complete tripartite graphs into cycles of lengths 3 and 4
- Decomposition of \(K_{m,n}\) into short cycles
- 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
- Modified group divisible designs with block size four
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- 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
- Decomposition of a complete bipartite multigraph into arbitrary cycle sizes
- Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles
- Decomposition of complete bipartite graphs into cycles of distinct even lengths
- Cycle decompositions III: Complete graphs and fixed length cycles
- Decomposing Complete Equipartite Multigraphs into Cycles of Variable Lengths: The Amalgamation-detachment Approach
- Cycle Frames of Complete Multipartite Multigraphs - III
- On the construction 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
- A textbook of graph theory
This page was built for publication: Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6