Upper bounds of entire chromatic number of plane graphs
From MaRDI portal
Publication:1294064
DOI10.1006/EUJC.1998.0258zbMath0924.05030OpenAlexW42302203MaRDI QIDQ1294064
Publication date: 15 September 1999
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1998.0258
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (5)
The entire choosability of plane graphs ⋮ Plane graphs with maximum degree 9 are entirely 11-choosable ⋮ Entire coloring of 2-connected plane graphs ⋮ Plane graphs with \(\Delta = 7\) are entirely 10-colorable ⋮ Entire colouring of plane graphs
This page was built for publication: Upper bounds of entire chromatic number of plane graphs
