Papers
Topics
Authors
Recent
Search
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 Σ\Sigma so that every contractible cycle has length at least 5, then G can be expressed as G=G′∪G1∪G2∪...∪GkG=G'\cup G_1\cup G_2\cup ... \cup G_k, where ∣V(G′)∣|V(G')| and kk are bounded by a constant (depending linearly on the genus of Σ\Sigma) and G1…,GkG_1\ldots,G_k 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.

Citations (8)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.