Decompositions of complete graphs into paths and cycles

Tay Woei Shyu*

*此作品的通信作者

研究成果: 雜誌貢獻期刊論文同行評審

21 引文 斯高帕斯(Scopus)

摘要

Abstract. Let Pk+1 denote a path of length k and let C k denote a cycle of length k. As usual Kn denotes the complete graph on n vertices. In this paper we investigate decompositions of Kn into paths and cycles, and give some necessary and/or sufficient conditions for such a decomposition to exist. Besides, we obtain a necessary and sufficient condition for decomposing Kn into p copies of P 5 and q copies of C4 for all possible values of p ≥ 0 and q ≥ 0.

原文英語
頁(從 - 到)257-270
頁數14
期刊Ars Combinatoria
97
出版狀態已發佈 - 2010 十月 1

ASJC Scopus subject areas

  • 數學(全部)

指紋

深入研究「Decompositions of complete graphs into paths and cycles」主題。共同形成了獨特的指紋。

引用此