- 期刊
FOREST DECOMPOSITIONS OF GRAPHS WITH CYCLOMATIC NUMBER 2
摘要
The tree polynomials [1] of the basic graphs with cyclomatic number 2 are derived. From these polynomials, results about forest decompositions are deduced. Explicit formulae are given for the number of decompositions of the basic graphs into forest with specified finite cardinalities.
延伸閱讀
- Johnson, P., & Krumpelman, A. (2021). On the Babai and Upper Chromatic Numbers of Graphs of Diameter 2. Tamkang Journal of Mathematics, 52(1), 113-123. https://doi.org/10.5556/j.tkjm.52.2021.3430
- 張哲專（2006）。The study of decomposing complete 4-partite graphs into cycles of length 3 or 4〔碩士論文，淡江大學〕。華藝線上圖書館。https://doi.org/10.6846/TKU.2006.00588
- 邱群博（2008）。The decomposition of complete graphs into sun graphs of 4-cycle〔碩士論文，淡江大學〕。華藝線上圖書館。https://doi.org/10.6846/TKU.2008.00637
- 何婉嫙（2010）。Decomposition of complete graph into 4-cycles or Hamilton cycles〔碩士論文，淡江大學〕。華藝線上圖書館。https://doi.org/10.6846/TKU.2010.00053
- 黃逸齊（2010）。Decomposition of complete graphs into 5-sun graphs.〔碩士論文，淡江大學〕。華藝線上圖書館。https://doi.org/10.6846/TKU.2010.00416