Back to Search
Start Over
List Colouring When The Chromatic Number Is Close To the Order Of The Graph.
- Source :
- Combinatorica; Dec2004, Vol. 25 Issue 1, p117-123, 91p
- Publication Year :
- 2004
-
Abstract
- Ohba has conjectured [7] that if G has 2 <subscript>?</subscript>( G)+1 or fewer vertices then the list chromatic number and chromatic number of G are equal. In this short note we prove the weaker version of the conjecture obtained by replacing 2 <subscript>?</subscript>( G)+1 by $$ \frac{5} {3}\chi {\left( G \right)} - \frac{4} {3}. $$ [ABSTRACT FROM AUTHOR]
- Subjects :
- CYCLOIDAL propellers
ACHROMATISM
COLOR
Subjects
Details
- Language :
- English
- ISSN :
- 02099683
- Volume :
- 25
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Combinatorica
- Publication Type :
- Academic Journal
- Accession number :
- 16658858