Upper bounds of entire chromatic number of plane graphs
From MaRDI portal
Publication:1294064
DOI10.1006/EUJC.1998.0258zbMATH Open0924.05030OpenAlexW42302203MaRDI QIDQ1294064FDOQ1294064
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)
Cited In (13)
- A characterization of the entire chromatic number of plane graphs with high maximum degree
- The entire choosability of plane graphs
- Upper chromatic number of finite projective planes
- An upper bound of linear chromatic number of planar graphs
- Entire colouring of plane graphs
- Plane graphs with maximum degree 9 are entirely 11-choosable
- Upper bound on the circular chromatic number of the plane
- A bound on the chromatic number of an almost planar graph
- Entire coloring of 2-connected plane graphs
- Plane graphs with \(\Delta = 7\) are entirely 10-colorable
- New upper bound on the chromatic number of the square of a planar graph
- Title not available (Why is that?)
- Structural theorem on plane graphs with application to the entire coloring number
Recommendations
- An upper bound of linear chromatic number of planar graphs 👍 👎
- Title not available (Why is that?) 👍 👎
- Upper bound on the circular chromatic number of the plane 👍 👎
- Title not available (Why is that?) 👍 👎
- The complete chromatic number of some planar graphs 👍 👎
- The complete chromatic number of some planar graphs 👍 👎
- Title not available (Why is that?) 👍 👎
- An upper bound for the total chromatic number 👍 👎
- New upper bounds for the chromatic number of a graph 👍 👎
- A bound on the chromatic number of an almost planar graph 👍 👎
This page was built for publication: Upper bounds of entire chromatic number of plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294064)
