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: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2020-08-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2153 |
| id |
doaj-19903f3b23804f38b68b09b25be94eb6 |
|---|---|
| record_format |
Article |
| spelling |
doaj-19903f3b23804f38b68b09b25be94eb62021-09-05T17:20:24ZengSciendoDiscussiones Mathematicae Graph Theory2083-58922020-08-0140382383910.7151/dmgt.2153dmgt.2153Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-StarsLee Hung-Chih0Chen Zhen-Chun1Department of Information Technology, Ling Tung University, Taichung 40852, TaiwanDepartment of Applied Mathematics, National Chiao Tung University, Hsinchu 300, TaiwanLet 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 necessary and sufficient conditions for decomposing the complete graph into α copies of Hamiltonian path (cycle) and β copies of S3.https://doi.org/10.7151/dmgt.2153decompositioncomplete graphhamiltonian pathhamiltonian cyclestar05c7005c38 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Lee Hung-Chih Chen Zhen-Chun |
| spellingShingle |
Lee Hung-Chih Chen Zhen-Chun Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars Discussiones Mathematicae Graph Theory decomposition complete graph hamiltonian path hamiltonian cycle star 05c70 05c38 |
| author_facet |
Lee Hung-Chih Chen Zhen-Chun |
| author_sort |
Lee Hung-Chih |
| title |
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars |
| title_short |
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars |
| title_full |
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars |
| title_fullStr |
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars |
| title_full_unstemmed |
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars |
| title_sort |
decomposing the complete graph into hamiltonian paths (cycles) and 3-stars |
| publisher |
Sciendo |
| series |
Discussiones Mathematicae Graph Theory |
| issn |
2083-5892 |
| publishDate |
2020-08-01 |
| description |
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 necessary and sufficient conditions for decomposing the complete graph into α copies of Hamiltonian path (cycle) and β copies of S3. |
| topic |
decomposition complete graph hamiltonian path hamiltonian cycle star 05c70 05c38 |
| url |
https://doi.org/10.7151/dmgt.2153 |
| work_keys_str_mv |
AT leehungchih decomposingthecompletegraphintohamiltonianpathscyclesand3stars AT chenzhenchun decomposingthecompletegraphintohamiltonianpathscyclesand3stars |
| _version_ |
1717786334767087616 |