On the fractional chromatic number, the chromatic number, and graph products

Sandi Klavžar, Hong Gwa Yeh

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

8 引文 斯高帕斯(Scopus)

摘要

It is shown that the difference between the chromatic number # and the fractional chromatic number yj can be arbitrarily large in the class of uniquely colorable, vertex transitive graphs. For the lexicographic product Go H it is shown that χ(GoH) > χf(G)χ(H). This bound has several consequences, in particular, it unifies and extends several known lower bounds. Lower bounds of Stahl (for general graphs) and of Bollobds and Thomason (for uniquely colorable graphs) are also proved in a simple, elementary way.

原文???core.languages.en_GB???
頁(從 - 到)235-242
頁數8
期刊Discrete Mathematics
247
發行號1-3
DOIs
出版狀態已出版 - 28 3月 2002

指紋

深入研究「On the fractional chromatic number, the chromatic number, and graph products」主題。共同形成了獨特的指紋。

引用此