Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars
From MaRDI portal
Publication:2175240
DOI10.7151/DMGT.2153zbMATH Open1439.05190OpenAlexW2889734884WikidataQ129227885 ScholiaQ129227885MaRDI QIDQ2175240FDOQ2175240
Publication date: 28 April 2020
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2153
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
Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Title not available (Why is that?)
- Graph decompositions, handcuffed prisoners and balanced p-designs
- Packing paths in complete graphs
- Decomposition of complete multigraphs into stars
- On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
- The wonderful Walecki construction
- Multidesigns for graph-pairs of order 4 and 5
- Decomposition of complete graphs into cycles and stars
- Title not available (Why is that?)
- Multidecomposition of \(\lambda K_m\) into small cycles and claws
- Title not available (Why is that?)
- Decomposition of the complete bipartite graph with a 1-factor removed into cycles and stars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decomposition of complete graphs into paths and stars
- Decomposition of complete bipartite graphs into paths and stars with same number of edges
- Title not available (Why is that?)
- Decomposition of complete bipartite graphs into paths and cycles
- Decompositions of multicrowns into cycles and stars
- Maximum packings and minimum coverings of multigraphs with paths and stars
- On the decompositions of complete graphs into cycles and stars on the same number of edges
- Decomposition of the complete bipartite multigraph into cycles and stars
- Multidecompositions of several graph products
- Decomposition of complete graphs into paths of length three and triangles.
- Title not available (Why is that?)
- Decomposition of complete multigraphs into stars and cycles
- Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges
- Balanced star decompositions of regular multigraphs and \(\lambda\)-fold complete bipartite graphs
- \((G_m,H_m)\)-multidecomposition of \(K_{m,m}(\lambda)\)
- Title not available (Why is that?)
- Decomposition of product graphs into paths and cycles of length four
Cited In (4)
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)