Flexibility of planar graphs of girth at least six
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 has girth at least six and all lists have size at least three, then there exists an L-coloring respecting at least a constant fraction of the preferences.
Cite
@article{arxiv.1902.04069,
title = {Flexibility of planar graphs of girth at least six},
author = {Zdeněk Dvořák and Tomáš Masařík and Jan Musílek and Ondřej Pangrác},
journal= {arXiv preprint arXiv:1902.04069},
year = {2021}
}
Comments
11 pages, no figures. arXiv admin note: text overlap with arXiv:1902.02971