Flexibility of planar graphs without $C_4$ and $C_5$
Combinatorics
2020-06-11 v1
Abstract
Let be a -free planar graph with a list assignment . Suppose a preferred color is given for some of the vertices. We prove that if all lists have size at least four, then there exists an -coloring respecting at least a constant fraction of the preferences.
Cite
@article{arxiv.2006.05243,
title = {Flexibility of planar graphs without $C_4$ and $C_5$},
author = {Donglei Yang and Fan Yang},
journal= {arXiv preprint arXiv:2006.05243},
year = {2020}
}
Comments
26 pages, 6 figures. arXiv admin note: text overlap with arXiv:1902.02971 by other authors