2000 character limit reached
Flexibility of planar graphs of girth at least six
Published 11 Feb 2019 in math.CO and cs.DM | (1902.04069v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
