5-choosability of graphs with crossings far apart

DOI10.1016/j.jctb.2016.11.004zbMath1354.05047arXiv1201.3014OpenAlexW3099384217MaRDI QIDQ505910

Bernard Lidický, Zdeněk Dvořák, Bojan Mohar

Publication date: 26 January 2017

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.3014

zbMATH Keywords

chromatic numbercrossing numberlist coloring

Mathematics Subject Classification ID

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

Related Items (5)

Hyperbolic families and coloring graphs on surfaces ⋮ 5-list-coloring planar graphs with distant precolored vertices ⋮ 1-planar graphs are odd 13-colorable ⋮ Facial unique-maximum colorings of plane graphs with restriction on big vertices ⋮ IC-Planar Graphs Are 6-Choosable

Cites Work

• 5-list-coloring planar graphs with distant precolored vertices
• List colourings of planar graphs
• You can't paint yourself into a corner
• Every planar graph is 5-choosable
• 3-list-coloring planar graphs of girth 5
• Graphs with Two Crossings Are 5-Choosable

This page was built for publication: 5-choosability of graphs with crossings far apart