2-List-coloring planar graphs without monochromatic triangles

Authors:
Carsten Thomassen
Affiliations:
Department of Mathematics, Technical University of Denmark, DK-2800 Lyngby, Denmark
Venue:
Journal of Combinatorial Theory Series B
Year:
2008

Citing 4
Cited 2

List colourings of planar graphs

Discrete Mathematics
Every planar graph is 5-choosable

Journal of Combinatorial Theory Series B
Coloring face-hypergraphs of graphs on surfaces

Journal of Combinatorial Theory Series B
A short list color proof of Grötzsch's theorem

Journal of Combinatorial Theory Series B

Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles

INFORMS Journal on Computing
Clique-transversal sets and clique-coloring in planar graphs

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that, for every list-assignment of two colors to every vertex of any planar graph, there is a list-coloring such that there is no monochromatic triangle. This proves and extends a conjecture of B. Mohar and R. Skrekovski and a related conjecture of A. Kundgen and R. Ramamurthi.