2000 character limit reached
Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations
Published 3 Sep 2015 in math.CO and cs.DM | (1509.01013v2)
Abstract: We give a linear-time algorithm to decide 3-colorability (and find a 3-coloring, if it exists) of quadrangulations of a fixed surface. The algorithm also allows to prescribe the coloring for a bounded number of vertices.
Paper Prompts
Sign up for free to create and run prompts on this paper.