A note on entire choosability of plane graphs

DOI10.1016/J.DAM.2011.12.014zbMATH Open1242.05065OpenAlexW2030014657MaRDI QIDQ423943FDOQ423943

Authors: Wei Dong Edit this on Wikidata

Publication date: 30 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.014

Recommendations

• The entire choosability of plane graphs
• Plane graphs are entirely \((\Delta + 5)\)-choosable
• Plane graphs with maximum degree 9 are entirely 11-choosable
• Plane graphs with \(\Delta = 7\) are entirely 10-colorable
• Entire choosability of near-outerplane graphs

zbMATH Keywords

list coloringplane graphentire coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Graph theory
• A seven-color theorem on the sphere
• On the Entire Coloring Conjecture
• The entire chromatic number of a normal graph is at most seven
• Entire colouring of plane graphs
• Coupled choosability of plane graphs

Cited In (8)

• The entire choosability of plane graphs
• The edge-face choosability of plane graphs
• Title not available (Why is that?)
• Entire choosability of near-outerplane graphs
• Plane graphs with maximum degree 9 are entirely 11-choosable
• Title not available (Why is that?)
• Plane graphs with \(\Delta = 7\) are entirely 10-colorable
• Plane graphs are entirely \((\Delta + 5)\)-choosable

This page was built for publication: A note on entire choosability of plane graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423943)