On the weak 2-coloring number of planar graphs

DOI10.1016/j.disc.2021.112631zbMath1476.05047OpenAlexW3203379066MaRDI QIDQ2237215

Ahlam Almulhim, Henry A. Kierstead

Publication date: 27 October 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112631

zbMATH Keywords

star chromatic numberplanar graphweak 2-coloring number

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Sparsity. Graphs, structures, and algorithms
• Colouring graphs with bounded generalized colouring number
• A simple competitive graph coloring algorithm
• Chromatic numbers of exact distance graphs
• Planar graphs have two-coloring number at most 8
• Orderings on graphs and game coloring number
• Coloring with no 2-colored \(P_4\)'s
• Uniform orderings for generalized coloring numbers
• Graphs with linearly bounded Ramsey numbers
• Grad and classes with bounded expansion. I: Decompositions
• Grad and classes with bounded expansion. II: Algorithmic aspects
• Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
• Dimension and height for posets with planar cover graphs.
• Colouring and Covering Nowhere Dense Graphs
• Graph Theory
• The Two-Coloring Number and Degenerate Colorings of Planar Graphs
• Radius two trees specify χ‐bounded classes
• Deciding First-Order Properties of Nowhere Dense Graphs
• On the generalised colouring numbers of graphs that exclude a fixed minor
• Competitive colorings of oriented graphs

This page was built for publication: On the weak 2-coloring number of planar graphs