Title of article
First-fit chromatic numbers of -degenerate graphs
Author/Authors
Chang، نويسنده , , Gerard Jennhwa and Hsu، نويسنده , , Hsiang-Chun، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2012
Pages
3
From page
2088
To page
2090
Abstract
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. In this short note, we first give counterexamples to some results by Balogh et al. (2008) [1], and then prove that every n -vertex d -degenerate graph has first-fit chromatic number at most log d + 1 d n + 2 .
Keywords
First-fit chromatic number , d -degenerate graph , Grundy number
Journal title
Discrete Mathematics
Serial Year
2012
Journal title
Discrete Mathematics
Record number
1598461
Link To Document