On the Entire Coloring Conjecture
From MaRDI portal
Recommendations
Cited in
(22)- Entire choosability of near-outerplane graphs
- On the list coloring version of Reed's conjecture
- Entire coloring of graphs embedded in a surface of nonnegative characteristic
- Coloring the faces of convex polyhedra so that like colors are far apart
- Plane graphs with \(\Delta = 7\) are entirely 10-colorable
- The entire chromatic number of graphs embedded on the torus with large maximum degree
- The entire coloring of series-parallel graphs
- Plane graphs with maximum degree 9 are entirely 11-choosable
- Entire \((\varDelta +2)\)-colorability of plane graphs
- The entire choosability of plane graphs
- Entire coloring of 2-connected plane graphs
- scientific article; zbMATH DE number 6518587 (Why is no real title available?)
- scientific article; zbMATH DE number 4160757 (Why is no real title available?)
- A note on entire choosability of plane graphs
- Plane graphs with maximum degree 8 are entirely ( +3)-colorable
- Coupled choosability of plane graphs
- On a coloring conjecture of Hajós
- Simultaneous coloring of vertices and incidences of outerplanar graphs
- Club-guessing, stationary reflection, and coloring theorems
- Entire colouring of plane graphs
- Facial entire coloring of K₄-minor-free graphs
- Entire coloring of plane graph with maximum degree eleven
This page was built for publication: On the Entire Coloring Conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4487056)