Decomposition of complete graphs into paths of length three and triangles.
From MaRDI portal
Recommendations
- Decomposition of complete tripartite graphs into cycles and paths of length three
- Decompositions of complete graphs into paths and cycles.
- Decomposition of complete graphs into triangles and claws
- Decomposition of complete graphs into paths and stars
- Decompositions of complete graphs into triangles and Hamilton cycles
Cited in
(21)- Multidecompositions of the balanced complete bipartite graph into paths and stars
- Decompositions of line graphs of complete graphs into paths and cycles
- Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars
- Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each
- Decomposition of the complete bipartite multigraph into cycles and stars
- Decompositions of complete graphs into kayak paddles with two odd cycles
- Decompositions of complete graphs into paths and cycles.
- scientific article; zbMATH DE number 1189019 (Why is no real title available?)
- scientific article; zbMATH DE number 2028650 (Why is no real title available?)
- scientific article; zbMATH DE number 2165735 (Why is no real title available?)
- Decompositions of complete graphs into triangles and Hamilton cycles
- Multidecompositions of line graphs of complete graphs
- Multidecomposition of Cartesian product of some graphs into even cycles and matchings
- \(K_n( \lambda )\) is fully \(\{P_5,C_6\}\)-decomposable
- Decomposition of complete graphs into triangles and claws
- Decomposition of complete tripartite graphs into cycles and paths of length three
- scientific article; zbMATH DE number 3895103 (Why is no real title available?)
- Path decomposition of graphs with given path length
- Decomposition of complete multigraphs into stars and cycles
- Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges
- Decomposition of complete graphs into paths and stars
This page was built for publication: Decomposition of complete graphs into paths of length three and triangles.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864450)
