Entire ( +2)-colorability of plane graphs
From MaRDI portal
Publication:2637243
Recommendations
Cites work
- A seven-color theorem on the sphere
- Colorings of plane graphs: a survey
- Entire colouring of plane graphs
- Graph theory
- On the Entire Coloring Conjecture
- On the total coloring of planar graphs.
- Plane graphs with maximum degree 8 are entirely ( +3)-colorable
- Structural theorem on plane graphs with application to the entire coloring number
- Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
- The entire chromatic number of a normal graph is at most seven
Cited in
(7)- Plane graphs with \(\Delta = 7\) are entirely 10-colorable
- Entire coloring of 2-connected plane graphs
- scientific article; zbMATH DE number 95245 (Why is no real title available?)
- Planar graphs with \(\Delta \geq 9\) are entirely \((\Delta+2)\)-colorable
- Plane graphs with maximum degree 8 are entirely ( +3)-colorable
- Entire coloring of plane graph with maximum degree eleven
- Entire chromatic number and \(\Delta\)-matching of outerplane graphs
This page was built for publication: Entire \((\varDelta +2)\)-colorability of plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2637243)