Skip to content

Opening book details…

Can I read Planar Graphs Are 1-Relaxed, 4-Choosable on EtoBox?

Planar Graphs Are 1-Relaxed, 4-Choosable by William Cushing; H.A. Kierstead is a Mathematics article available to read on EtoBox.

What is Planar Graphs Are 1-Relaxed, 4-Choosable about?

We show that every planar graph G = (V , E) is 1-relaxed, 4choosable. 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.

Who reads Planar Graphs Are 1-Relaxed, 4-Choosable?

It is typically read by researchers, students, and practitioners in Mathematics.

Author
William Cushing; H.A. Kierstead
Publisher
Elsevier Science; Elsevier ; Elsevier Inc.; Elsevier BV (ISSN 0195-6698)
Published
2010
Language
EN
Field
Mathematics (Physical Sciences)

More by William Cushing; H.A. Kierstead

Browse all works by William Cushing; H.A. Kierstead