DECOMPOSING THE COMPLETE GRAPH INTO HAMILTONIAN PATHS (CYCLES) AND 3-STARS

檔案

本條目沒有附加檔案。

日期

2020-01-01

期刊名稱

DISCUSSIONES MATHEMATICAE GRAPH THEORY

摘要

Let H be a graph. A decomposition of H is a set of edge-disjoint sub-graphs 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 S-k, is a star with k edges. In this paper, we give necessary and sufficient conditions for decomposing the complete graph into alpha copies of Hamiltonian path (cycle) and beta copies of S-3.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Lee, H.-C., & Chen, Z.-C. (2020). DECOMPOSING THE COMPLETE GRAPH INTO HAMILTONIAN PATHS (CYCLES) AND 3-STARS. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 40(3), 823–839. https://doi.org/10.7151/dmgt.2153

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/154808