Decomposition of complete graphs into cycles and stars
From MaRDI portal
Publication:1950399
DOI10.1007/s00373-011-1105-3zbMath1263.05079OpenAlexW1965811294MaRDI QIDQ1950399
Publication date: 13 May 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-011-1105-3
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars ⋮ Decomposition of the complete bipartite graph with a 1-factor removed into cycles and stars ⋮ Decomposition of complete bipartite graphs into paths and cycles ⋮ Decomposition of complete multigraphs into stars and cycles ⋮ Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges ⋮ Multidecompositions of the balanced complete bipartite graph into paths and stars ⋮ Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each ⋮ Decomposition of product graphs into paths and cycles of length four ⋮ Multidecompositions of line graphs of complete graphs ⋮ Decompositions of line graphs of complete graphs into paths and cycles ⋮ Decomposition of product graphs into paths and stars on five vertices ⋮ Decomposition of the complete bipartite multigraph into cycles and stars ⋮ Multidecomposition of cartesian product of some graphs into even cycles and matchings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Alspach's conjecture
- Decomposition of complete multigraphs into stars
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- On claw-decomposition of complete graphs and complete bigraphs
- \((m,n)\)-cycle systems
- Multidesigns for graph-pairs of order 4 and 5
- On Alspach's conjecture with two even cycle lengths
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Cycle decompositions III: Complete graphs and fixed length cycles
- Some observations on the oberwolfach problem
- 3,5-Cycle decompositions
- Decompositions of complete graphs into triangles and Hamilton cycles
- Even cycle decompositions of complete graphs minus a 1‐factor
- List decomposition of graphs.
This page was built for publication: Decomposition of complete graphs into cycles and stars