2-coloring number revisited

DOI10.1016/J.TCS.2019.09.009MaRDI QIDQ2333797zbMATH OpenOpenAlexFDO

Authors R. 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)

Recommendations

• Coloring games on squares of graphs
• Game colouring of the square of graphs
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
• Game chromatic number of graphs with locally bounded number of cycles
• A note on the connected game coloring number

Cites work

• A new game chromatic number
• Colouring and covering nowhere dense graphs
• Colouring graphs with bounded generalized colouring number
• Efficient graph packing via game colouring
• Graph theory
• On the generalised colouring numbers of graphs that exclude a fixed minor
• Orderings on graphs and game coloring number
• Planar graphs have two-coloring number at most 8
• Radius two trees specify χ‐bounded classes
• Smallest-last ordering and clustering and graph coloring algorithms
• The Map-Coloring Game
• The two-coloring number and degenerate colorings of planar graphs

Cited in

(4)

• Two remarks on the coloring number
• Removing colors 2k, 2k − 1, and k
• The 2-color relative linear van der Waerden numbers
• A note on the connected game coloring number

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333797)