Flexibility of triangle-free planar graphs
Combinatorics
2021-02-17 v1 Discrete Mathematics
Abstract
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.
Cite
@article{arxiv.1902.02971,
title = {Flexibility of triangle-free planar graphs},
author = {Zdeněk Dvořák and Tomáš Masařík and Jan Musílek and Ondřej Pangrác},
journal= {arXiv preprint arXiv:1902.02971},
year = {2021}
}
Comments
28 pages, 5 figures