The Two-Coloring Number and Degenerate Colorings of Planar Graphs
From MaRDI portal
Publication:3583325
DOI10.1137/070703697zbMath1207.05058OpenAlexW2099957850MaRDI QIDQ3583325
Simon Špacapan, Bojan Mohar, Xuding Zhu, Daqing Yang, Henry A. Kierstead
Publication date: 27 August 2010
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070703697
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (10)
On a vertex-edge marking game on graphs ⋮ Improved upper bound for the degenerate and star chromatic numbers of graphs ⋮ 3‐Degenerate induced subgraph of a planar graph ⋮ Adapted game colouring of graphs ⋮ Degenerate and star colorings of graphs on surfaces ⋮ On the weak 2-coloring number of planar graphs ⋮ Planar graphs have two-coloring number at most 8 ⋮ Activation strategy for relaxed asymmetric coloring games ⋮ Generalization of transitive fraternal augmentations for directed graphs and its applications ⋮ 2-coloring number revisited
This page was built for publication: The Two-Coloring Number and Degenerate Colorings of Planar Graphs
