On chromatic polynomials of regular graphs and modified wheels

Let P(G,y) denote the chromatic polynomial of a graph G expressed in the variable y. A graph G is chromatically unique if P(G,y) = P(H,y) implies that H is isomorphic to G. It is proven that complements of partial matching forest are chromatically unique. An infinite family of counterexamples to the...

全面介紹

Saved in:
書目詳細資料
主要作者: Aves, Lovelina A.
格式: text
語言:English
出版: Animo Repository 1994
主題:
在線閱讀:https://animorepository.dlsu.edu.ph/etd_masteral/1550
https://animorepository.dlsu.edu.ph/context/etd_masteral/article/8388/viewcontent/TG02237_F_Redacted.pdf
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!