Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars
Let H be a graph. A decomposition of H is a set of edge-disjoint subgraphs of H whose union is H. A Hamiltonian path (respectively, cycle) of H is a path (respectively, cycle) that contains every vertex of H exactly once. A k-star, denoted by Sk, is a star with k edges. In this paper, we give necess...
Main Authors: | Lee Hung-Chih, Chen Zhen-Chun |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2020-08-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2153 |
Similar Items
-
Decompositions of Complete Bipartite Graphs and Complete Graphs Into Paths, Stars, and Cycles with Four Edges Each
by: Shyu Tay-Woei
Published: (2021-05-01) -
Lower Bound on the Number of Hamiltonian Cycles of Generalized Petersen Graphs
by: Lu Weihua, et al.
Published: (2020-02-01) -
Matchings Extend to Hamiltonian Cycles in 5-Cube
by: Wang Fan, et al.
Published: (2018-02-01) -
On the Hamiltonian Number of a Plane Graph
by: Lewis Thomas M.
Published: (2019-02-01) -
Arc-Disjoint Hamiltonian Paths in Strong Round Decomposable Local Tournaments
by: Meng Wei
Published: (2021-02-01)