Flexibility of planar graphs of girth at least six
Zdenĕk Dvořák, Tomáš Masařík, Jan Musílek, Ondřej Pangrác · Journal of Graph Theory · 2020
Abstract Let be a planar graph with a list assignment . Suppose a preferred color is given for some of the vertices. We prove that if has girth at least six and all lists have size at least three, then there exists an ‐coloring respecting at least a constant fraction of the preferences.