Entire choosability of near-outerplane graphs

DOI10.1016/J.DISC.2008.04.043zbMath1198.05053OpenAlexW2088326412MaRDI QIDQ1025470

Timothy J. Hetherington

Publication date: 19 June 2009

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

Full work available at URL: http://irep.ntu.ac.uk/id/eprint/9378/1/200152_6539%20Hetherington%20Preprint.pdf

zbMATH Keywords

series-parallel graphouterplanar graphminor-free graphentire colouring conjecture

Mathematics Subject Classification ID

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

Related Items (2)

The entire choosability of plane graphs ⋮ Plane graphs with maximum degree 9 are entirely 11-choosable

Cites Work

• Edge and total choosability of near-outerplanar graphs
• On simultaneous edge-face colorings of plane graphs
• Simultaneously colouring the edges and faces of plane graphs
• Ein Sechsfarbenproblem auf der Kugel
• A seven-color theorem on the sphere
• The entire coloring of series-parallel graphs
• A short proof of a theorem of dirac's about hadwiger's conjecture
• On the Entire Coloring Conjecture
• The entire chromatic number of a normal graph is at most seven
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Entire choosability of near-outerplane graphs