Flexibility of triangle-free planar graphs

Zdeněk Dvořák, Tomáš Masařík, Jan Musílek, Ondřej Pangrác

Let G be a planar graph with a list assignment L. Suppose a preferred color is given for some of the vertices. We prove that if G is triangle-free and all lists have size at least four, then there exists an L-coloring respecting at least a constant fraction of the preferences.

Knowledge Graph



Sign up or login to leave a comment