@article{9dfbdcddb5d9455cb2073f99a7b45404,

title = "On the fractional chromatic number, the chromatic number, and graph products",

abstract = "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.",

keywords = "Chromatic number, Fractional chromatic number, Graph product, Uniquely colorable graph",

author = "Sandi Klav{\v z}ar and Yeh, {Hong Gwa}",

note = "Funding Information: ∗Corresponding author. E-mail addresses: sandi.klavzar@uni-lj.si (S. Klavz'ar), hgyeh@nuk.edu.tw (H.-G. Yeh). 1Supported by the Ministry of Science and Technology of Slovenia under the Grant 101-504. 2Supported in part by the National Science Council under Grant NSC 89-2115-M008-008.",

year = "2002",

month = mar,

day = "28",

doi = "10.1016/S0012-365X(01)00312-0",

language = "???core.languages.en_GB???",

volume = "247",

pages = "235--242",

journal = "Discrete Mathematics",

issn = "0012-365X",

number = "1-3",

}