2000 character limit reached
4-critical graphs on surfaces without contractible (<=4)-cycles
Published 13 May 2013 in math.CO and cs.DM | (1305.2670v2)
Abstract: We show that if G is a 4-critical graph embedded in a fixed surface so that every contractible cycle has length at least 5, then G can be expressed as , where and are bounded by a constant (depending linearly on the genus of ) and are graphs (of unbounded size) whose structure we describe exactly. The proof is computer-assisted - we use computer to enumerate all plane 4-critical graphs of girth 5 with a precolored cycle of length at most 16, that are used in the basic case of the inductive proof of the statement.
Paper Prompts
Sign up for free to create and run prompts on this paper.