Decomposition of complete graphs into triangles and claws
From MaRDI portal
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
(15)- Triangulating remnants of complete graphs
- Decomposition of complete equipartite graphs into paths and cycles of length 2p
- Decompositions of line graphs of complete graphs into paths and cycles
- Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each
- Decomposition of complete graphs into paths of length three and triangles.
- Decomposition of a Complete Multi-Partite Graph into Isomorphic Claws
- On edge decompositions of a complete graph into smaller complete graphs.
- Decomposition of complete graphs into 4-cycles and 3-stars
- Decompositions of complete graphs into triangles and Hamilton cycles
- Multidecompositions of line graphs of complete graphs
- Claw-decomposition of Kneser graphs
- Decomposition of complete Tripartite graphs into triangles and claws
- Decomposition of complete graphs into paths and stars with different number of edges
- Decomposition of the Cartesian product of complete graphs into paths and cycles of length six
- Title not available (Why is no real title available?)
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)
