Decomposition of complete graphs into triangles and claws
From MaRDI portal
Publication:514778
DOI10.11650/TJM.18.2014.3169zbMATH Open1357.05099OpenAlexW2032131595MaRDI QIDQ514778FDOQ514778
Authors: Chin-Mei Fu, Y.-L. Lin, Shu-Wen Lo, Yu-Fong Hsu 
Publication date: 9 March 2017
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11650/tjm.18.2014.3169
Recommendations
- Decomposition of complete graphs into paths of length three and triangles.
- Decomposition of complete graphs into 4-cycles and 3-stars
- Decompositions of complete graphs into triangles and Hamilton cycles
- Decomposition of complete tripartite graphs into cycles and paths of length three
- Decomposition of complete graphs into cycles and stars
Cited In (13)
- Triangulating remnants of complete graphs
- Claw-decomposition of Kneser graphs
- Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each
- On edge decompositions of a complete graph into smaller complete graphs.
- Decomposition of complete Tripartite graphs into triangles and claws
- Multidecompositions of line graphs of complete graphs
- Decomposition of complete graphs into paths and stars with different number of edges
- Decomposition of complete equipartite graphs into paths and cycles of length \(2p\)
- Decomposition of a Complete Multi-Partite Graph into Isomorphic Claws
- Decomposition of complete graphs into 4-cycles and 3-stars
- Decompositions of complete graphs into triangles and Hamilton cycles
- Decomposition of complete graphs into paths of length three and triangles.
- Decompositions of line graphs of complete graphs into paths and cycles
This page was built for publication: Decomposition of complete graphs into triangles and claws
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q514778)
