Planar graphs are 1-relaxed, 4-choosable

William Cushing, Henry Kierstead

Research output: Contribution to journalArticlepeer-review

36 Scopus citations


We show that every planar graph G = (V, E) is 1-relaxed, 4-choosable. This means that, for every list assignment L that assigns a set of at least four colors to each vertex, there exists a coloring f such that f (v) ∈ L (v) for every vertex v ∈ V and each color class f- 1 (α) of f induces a subgraph with maximum degree at most 1.

Original languageEnglish (US)
Pages (from-to)1385-1397
Number of pages13
JournalEuropean Journal of Combinatorics
Issue number5
StatePublished - Jul 2010

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Planar graphs are 1-relaxed, 4-choosable'. Together they form a unique fingerprint.

Cite this