On the decompositions of complete graphs into cycles and stars on the same number of edges
From MaRDI portal
Publication:5405281
DOI10.7151/DMGT.1719zbMath1292.05211OpenAlexW2044751955MaRDI QIDQ5405281
Publication date: 2 April 2014
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1719
Related Items (8)
Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars ⋮ Decomposition of complete multigraphs into stars and cycles ⋮ Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges ⋮ Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each ⋮ A subspace covering problem in the \(n\)-cube ⋮ Unnamed Item ⋮ Multidecompositions of line graphs of complete graphs ⋮ Decompositions of line graphs of complete graphs into paths and cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposition of complete graphs into paths and stars
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- On claw-decomposition of complete graphs and complete bigraphs
- Multidesigns for graph-pairs of order 4 and 5
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Cycle decompositions III: Complete graphs and fixed length cycles
- Cycle decompositions of complete multigraphs
This page was built for publication: On the decompositions of complete graphs into cycles and stars on the same number of edges