Upper bounds of entire chromatic number of plane graphs
From MaRDI portal
(Redirected from Publication:1294064)
Recommendations
- An upper bound of linear chromatic number of planar graphs
- On upper bounds for the multi-fold chromatic numbers of the plane
- Upper bound on the circular chromatic number of the plane
- scientific article; zbMATH DE number 4108789
- The complete chromatic number of some planar graphs
- The complete chromatic number of some planar graphs
- scientific article; zbMATH DE number 861441
- 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
Cited in
(16)- A characterization of the entire chromatic number of plane graphs with high maximum degree
- An upper bound of linear chromatic number of planar graphs
- Entire coloring of 2-connected plane graphs
- New upper bound on the chromatic number of the square of a planar graph
- The entire coloring of series-parallel graphs
- Plane graphs with \(\Delta = 7\) are entirely 10-colorable
- Entire chromatic number and \(\Delta\)-matching of outerplane graphs
- A bound on the chromatic number of an almost planar graph
- Upper bound on the circular chromatic number of the plane
- scientific article; zbMATH DE number 95245 (Why is no real title available?)
- Entire colouring of plane graphs
- Structural theorem on plane graphs with application to the entire coloring number
- Entire \((\varDelta +2)\)-colorability of plane graphs
- The entire choosability of plane graphs
- Plane graphs with maximum degree 9 are entirely 11-choosable
- Upper chromatic number of finite projective planes
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)
