scientific article; zbMATH DE number 7057485
From MaRDI portal
Publication:5377023
zbMath1411.05218MaRDI QIDQ5377023
Publication date: 23 May 2019
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/73/ajc_v73_p220.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items (3)
Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6 ⋮ Decompositions of some classes of dense graphs into cycles of lengths 4 and 8 ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \((4, 5)\)-cycle systems of complete multipartite graphs
- Decomposing complete tripartite graphs into 5-cycles when the partite sets have similar size
- Sparse graphs which decompose into closed trails of arbitrary lengths
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Decomposing complete tripartite graphs into cycles of lengths 3 and 4
- Decomposition of \(K_{m,n}\) into short cycles
- Further decompositions of complete tripartite graphs into 5-cycles
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Decompositions of complete multipartite graphs into cycles of even length
- \(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
- Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
- 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
- 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
- Cycle decompositions V: Complete graphs into cycles of arbitrary lengths
- A Complete Solution to the Existence of ‐Cycle Frames of Type
- Cyclic and symmetric hamiltonian cycle systems of the complete multipartite graph: even number of parts
- A textbook of graph theory
This page was built for publication: