Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars

DOI10.7151/dmgt.2153zbMath1439.05190OpenAlexW2889734884WikidataQ129227885 ScholiaQ129227885MaRDI QIDQ2175240

Zhen-Chun Chen, Hung-Chih Lee

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

zbMATH Keywords

decompositionHamiltonian cycleHamiltonian pathcomplete graphstar

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Decomposition of the complete bipartite graph with a 1-factor removed into cycles and stars
• 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
• Decomposition of complete multigraphs into stars and cycles
• Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges
• Packing paths in complete graphs
• Decomposition of complete graphs into paths and stars
• Decomposition of complete multigraphs into stars
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• Multidesigns for graph-pairs of order 4 and 5
• Decomposition of complete bipartite graphs into paths and stars with same number of edges
• Decomposition of complete graphs into cycles and stars
• Decomposition of the complete bipartite multigraph into cycles and stars
• Multidecompositions of several graph products
• Graph decompositions, handcuffed prisoners and balanced p-designs
• Balanced star decompositions of regular multigraphs and \(\lambda\)-fold complete bipartite graphs
• On the decompositions of complete graphs into cycles and stars on the same number of edges
• Decomposition of product graphs into paths and cycles of length four
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars