Decomposing various graphs into short even-length cycles
From MaRDI portal
Publication:1928579
DOI10.1007/s00026-012-0147-4zbMath1256.05189arXiv1204.3368OpenAlexW2963628150MaRDI QIDQ1928579
Publication date: 3 January 2013
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.3368
Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (9)
Decomposition of complete bipartite graphs into cycles of distinct even lengths ⋮ Small Embeddings of Partial Steiner Triple Systems ⋮ Decomposing \(K_{u + w} - K_u\) into cycles of prescribed lengths ⋮ Decomposition of a complete bipartite multigraph into arbitrary cycle sizes ⋮ A novel approach for cyclic decompositions of balanced complete bipartite graphs into infinite graph classes ⋮ GENERALISATIONS OF THE DOYEN–WILSON THEOREM ⋮ Decomposing Complete Equipartite Multigraphs into Cycles of Variable Lengths: The Amalgamation-detachment Approach ⋮ Doyen-Wilson Results for Odd Length Cycle Systems ⋮ Decomposition of complete equipartite graphs into paths and cycles of length \(2p\)
Cites Work
- Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
- Decomposition of \(K_{m,n}\) into short cycles
- On decomposing \(K_n -I\) into cycles of a fixed odd length
- Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\)
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Cycle systems in the complete bipartite graph minus a one-factor
- An asymptotic solution to the cycle decomposition problem for complete graphs
- Decompositions of complete multipartite graphs into cycles of even length
- Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles
- Cycle decompositions III: Complete graphs and fixed length cycles
- Maximum packings of the complete graph with uniform length cycles
- On the construction of odd cycle systems
- Decompositions of complete graphs into long cycles
- Cycle Decompositions of $K_{\lowercase{n,n}}-I$
- Unnamed Item
- Unnamed Item
This page was built for publication: Decomposing various graphs into short even-length cycles