Planar Graphs with $\Delta\ge 9$ are Entirely $(\Delta+2)$-Colorable
From MaRDI portal
Publication:5246090
DOI10.1137/130938992zbMath1309.05080OpenAlexW1996663687MaRDI QIDQ5246090
Xiaoxue Hu, Wei Fan Wang, Yi Qiao Wang
Publication date: 17 April 2015
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/130938992
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (6)
The entire choosability of plane graphs ⋮ Plane graphs with maximum degree 9 are entirely 11-choosable ⋮ The entire chromatic number of graphs embedded on the torus with large maximum degree ⋮ Entire coloring of 2-connected plane graphs ⋮ Plane graphs with \(\Delta = 7\) are entirely 10-colorable ⋮ Entire coloring of graphs embedded in a surface of nonnegative characteristic
This page was built for publication: Planar Graphs with $\Delta\ge 9$ are Entirely $(\Delta+2)$-Colorable
