On the Entire Coloring Conjecture
From MaRDI portal
Publication:4487056
DOI10.4153/CMB-2000-017-7zbMath0944.05030OpenAlexW2054908111WikidataQ123290381 ScholiaQ123290381MaRDI QIDQ4487056
Publication date: 15 September 2000
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cmb-2000-017-7
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (15)
The entire choosability of plane graphs ⋮ Plane graphs with maximum degree 9 are entirely 11-choosable ⋮ Entire \((\varDelta +2)\)-colorability of plane graphs ⋮ The entire chromatic number of graphs embedded on the torus with large maximum degree ⋮ Plane Graphs with Maximum Degree Are Entirely ‐Colorable ⋮ Entire coloring of 2-connected plane graphs ⋮ Plane graphs with \(\Delta = 7\) are entirely 10-colorable ⋮ Simultaneous coloring of vertices and incidences of outerplanar graphs ⋮ A note on entire choosability of plane graphs ⋮ Entire colouring of plane graphs ⋮ Coupled choosability of plane graphs ⋮ Entire coloring of graphs embedded in a surface of nonnegative characteristic ⋮ Entire coloring of plane graph with maximum degree eleven ⋮ Entire choosability of near-outerplane graphs ⋮ The entire coloring of series-parallel graphs
This page was built for publication: On the Entire Coloring Conjecture
