2-coloring number revisited

DOI10.1016/j.tcs.2019.09.009zbMath1435.05077OpenAlexW2973123347MaRDI QIDQ2333797

Robert Janczewski, Paweł Obszarski, Krzysztof Turowski

Publication date: 13 November 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.09.009

zbMATH Keywords

subcubic graphsthorny graphs2-coloring numbergraph chromatic game

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Colouring graphs with bounded generalized colouring number
• Planar graphs have two-coloring number at most 8
• Orderings on graphs and game coloring number
• Colouring and Covering Nowhere Dense Graphs
• Efficient Graph Packing via Game Colouring
• The Two-Coloring Number and Degenerate Colorings of Planar Graphs
• Smallest-last ordering and clustering and graph coloring algorithms
• Radius two trees specify χ‐bounded classes
• The Map-Coloring Game
• On the generalised colouring numbers of graphs that exclude a fixed minor
• A new game chromatic number

This page was built for publication: 2-coloring number revisited