Free choosability of outerplanar graphs

DOI10.1007/s00373-015-1625-3zbMath1339.05065OpenAlexW2143794262MaRDI QIDQ293600

Jean-Christophe Godin, Yves Aubry, Olivier Togni

Publication date: 9 June 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1625-3

zbMATH Keywords

cyclecoloringchoosabilityouterplanar graphfree choosability

Mathematics Subject Classification ID

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

Related Items (1)

Conflict-free coloring bounds on open neighborhoods

Cites Work

• Unnamed Item
• Unnamed Item
• Some results on \((a:b)\)-choosability
• Choosability and fractional chromatic numbers
• Choosability of planar graphs
• Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable

This page was built for publication: Free choosability of outerplanar graphs