Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars
From MaRDI portal
(Redirected from Publication:2175240)
Recommendations
- Decomposition of the complete bipartite graph with a 1-factor removed into paths and stars
- Decomposition of complete bipartite graphs into paths and stars with same number of edges
- Decomposition of complete graphs into paths and stars
- Decomposition of the complete bipartite graph with a 1-factor removed into cycles and stars
- Decomposition of the complete bipartite multigraph into cycles and stars
Cites work
- scientific article; zbMATH DE number 2186980 (Why is no real title available?)
- scientific article; zbMATH DE number 47528 (Why is no real title available?)
- scientific article; zbMATH DE number 1792667 (Why is no real title available?)
- scientific article; zbMATH DE number 2192102 (Why is no real title available?)
- Balanced star decompositions of regular multigraphs and \(\lambda\)-fold complete bipartite graphs
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Decomposition of complete bipartite graphs into paths and cycles
- Decomposition of complete bipartite graphs into paths and stars with same number of edges
- Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges
- Decomposition of complete graphs into cycles and stars
- Decomposition of complete graphs into paths and stars
- Decomposition of complete graphs into paths of length three and triangles.
- Decomposition of complete multigraphs into stars
- Decomposition of complete multigraphs into stars and cycles
- Decomposition of product graphs into paths and cycles of length four
- Decomposition of the complete bipartite graph with a 1-factor removed into cycles and stars
- Decomposition of the complete bipartite multigraph into cycles and stars
- Decompositions of complete graphs into paths and cycles.
- Decompositions of multicrowns into cycles and stars
- Graph decompositions, handcuffed prisoners and balanced p-designs
- Maximum packings and minimum coverings of multigraphs with paths and stars
- Multidecomposition of K_n-F into graph-pairs of order 5 where F is a Hamilton cycle or an (almost) 1-factor.
- Multidecomposition of K_m into small cycles and claws
- Multidecomposition of the complete graph into graph pairs of order 4 with various leaves.
- Multidecompositions of complete bipartite graphs into cycles and stars
- Multidecompositions of several graph products
- Multidesigns for graph-pairs of order 4 and 5
- On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
- On the decompositions of complete graphs into cycles and stars on the same number of edges
- Packing paths in complete graphs
- The wonderful Walecki construction
- \((G_m,H_m)\)-multidecomposition of \(K_{m,m}(\lambda)\)
- (G_m,H_m)-multifactorization of K_m
Cited in
(11)- Trois Types De Décompositions D'un Graphe En Chaînes
- scientific article; zbMATH DE number 2210802 (Why is no real title available?)
- Decomposition of the Johnson graphs into graph-pairs of order 4
- Decomposition of graphs into trees of order five
- Improved bounds for codes over trees
- Systolic embedding of graphs on translation surfaces
- Hamiltonian decompositions of complete graphs
- 3-Perfect hamiltonian decomposition of the complete graph
- On decompositions of the Johnson graph
- Multidecomposition of hypercube graphs into paths, cycles and stars
- Decomposition of hypercube graphs into paths and cycles having k edges
This page was built for publication: Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175240)
