Emergent Mind
Flexibility of planar graphs of girth at least six
(1902.04069)
Published Feb 11, 2019
in
math.CO
and
cs.DM
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.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.