2-list-coloring planar graphs without monochromatic triangles

DOI10.1016/j.jctb.2008.02.006zbMath1167.05029OpenAlexW2082317855WikidataQ56926617 ScholiaQ56926617MaRDI QIDQ958693

Carsten Thomassen

Publication date: 8 December 2008

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2008.02.006

zbMATH Keywords

list colorings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Colorings of oriented planar graphs avoiding a monochromatic subgraph ⋮ Colorings of plane graphs without long monochromatic facial paths ⋮ Disjoint total dominating sets in near‐triangulations ⋮ Clique-transversal sets and clique-coloring in planar graphs ⋮ A linear-time algorithm for clique-coloring problem in circular-arc graphs ⋮ Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete ⋮ Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles

Cites Work

• Unnamed Item
• List colourings of planar graphs
• The Grötzsch theorem for the hypergraph of maximal cliques
• Every planar graph is 5-choosable
• A short list color proof of Grötzsch's theorem
• Coloring face-hypergraphs of graphs on surfaces

This page was built for publication: 2-list-coloring planar graphs without monochromatic triangles