On \(t\)-common list-colorings

zbMath1369.05069MaRDI QIDQ2401414

Hojin Choi, Young Soo Kwon

Publication date: 8 September 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i3p32

zbMATH Keywords

graph coloringplanar graphlist coloring

Mathematics Subject Classification ID

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

Related Items (7)

A note on not-4-list colorable planar graphs ⋮ Flexible list colorings in graphs with special degeneracy conditions ⋮ Chromatic λ‐choosable and λ‐paintable graphs ⋮ List 4-colouring of planar graphs ⋮ The Alon-Tarsi number of a planar graph minus a matching ⋮ Flexible List Colorings in Graphs with Special Degeneracy Conditions ⋮ A refinement of choosability of graphs

Cites Work

• List colourings of planar graphs
• The complexity of planar graph choosability
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Every planar graph is 5-choosable
• Smaller planar triangle-free graphs that are not 3-list-colorable
• A not 3-choosable planar graph without 3-cycles
• A Hajós-like theorem for list coloring
• Grötzsch's theorem on 3-colorings

This page was built for publication: On \(t\)-common list-colorings