2000 character limit reached
3-coloring triangle-free planar graphs with a precolored 8-cycle
Published 11 May 2013 in math.CO and cs.DM | (1305.2467v1)
Abstract: Let G be a planar triangle-free graph and let C be a cycle in G of length at most 8. We characterize all situations where a 3-coloring of C does not extend to a proper 3-coloring of the whole graph.
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.