On list-coloring outerplanar graphs

DOI10.1002/jgt.20326zbMath1235.05052OpenAlexW4230777426MaRDI QIDQ3528160

Joan P. Hutchinson

Publication date: 8 October 2008

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20326

zbMATH Keywords

outerplanar graphslist coloringGallai tree

Mathematics Subject Classification ID

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

Related Items (2)

List Colorings of K5-Minor-Free Graphs With Special List Assignments ⋮ Some Conjectures and Questions in Chromatic Topological Graph Theory

Cites Work

• Unnamed Item
• List colourings of planar graphs
• Graph color extensions: When Hadwiger's conjecture and embeddings help
• Distance constraints in graph color extensions
• You can't paint yourself into a corner
• Every planar graph is 5-choosable
• The colour theorems of Brooks and Gallai extended
• Color-critical graphs on a fixed surface
• Extending graph colorings
• Precoloring extension forK₄-minor-free graphs

This page was built for publication: On list-coloring outerplanar graphs