The entire chromatic number of a normal graph is at most seven
From MaRDI portal
Publication:5666578
DOI10.1090/S0002-9904-1972-13041-6zbMath0253.05121MaRDI QIDQ5666578
Publication date: 1972
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)
Related Items (8)
The entire choosability of plane graphs ⋮ Plane graphs with maximum degree 9 are entirely 11-choosable ⋮ Entire \((\varDelta +2)\)-colorability of plane graphs ⋮ Plane Graphs with Maximum Degree Are Entirely ‐Colorable ⋮ Plane graphs with \(\Delta = 7\) are entirely 10-colorable ⋮ A note on entire choosability of plane graphs ⋮ Entire coloring of plane graph with maximum degree eleven ⋮ Entire choosability of near-outerplane graphs
Cites Work
This page was built for publication: The entire chromatic number of a normal graph is at most seven
