The Two-Coloring number and degenerate colorings of planar graphs

Henry Kierstead, Bojan Mohar, Simon Špacapan, Daqing Yang, Xuding Zhiu

Research output: Contribution to journalArticle

7 Scopus citations


The two-coloring number of graphs, which was originally introduced in the study of the game chromatic number, also gives an upper bound on t he degenerate chromatic number as introduced by Borodin. It is proved that the two-coloring number of any planar graph is at most nine. As a consequence, the degenerate list chromatic number of any planar graph is at most nine. It is also shown that the degenerate diagonal chromatic number is at most 11 and the degenerate diagonal list chromatic number is at most 12 for all planar graphs.

Original languageEnglish (US)
Pages (from-to)1548-1560
Number of pages13
JournalSIAM Journal on Discrete Mathematics
Issue number3
StatePublished - Dec 1 2009



  • Degenerate coloring
  • Planar graph
  • Two-coloring number

ASJC Scopus subject areas

  • Mathematics(all)

Cite this