Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers

2Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

For a graph G on n vertices with chromatic number χ (G), the Nordhaus-Gaddum inequalities state that ⌈ 2 sqrt(n) ⌉ ≤ χ (G) + χ (over(G, -)) ≤ n + 1, and n ≤ χ (G) {dot operator} χ (over(G, -)) ≤ ⌊ (frac(n + 1, 2))2 ⌋. Much analysis has been done to derive similar inequalities for other graph parameters, all of which are integer-valued. We determine here the optimal Nordhaus-Gaddum inequalities for the circular chromatic number and the fractional chromatic number, the first examples of Nordhaus-Gaddum inequalities where the graph parameters are rational-valued. © 2008 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Brown, J. I., & Hoshino, R. (2009). Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers. Discrete Mathematics, 309(8), 2223–2232. https://doi.org/10.1016/j.disc.2008.04.052

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free