English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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 expressedas $G=G'\cup G_1\cup G_2\cup ... \cup G_k$, where $|V(G')|$ and $k$ are boundedby a constant (depending linearly on the genus of $\Sigma$) and $G_1\ldots,G_k$are graphs (of unbounded size) whose structure we describe exactly. The proofis computer-assisted - we use computer to enumerate all plane 4-critical graphsof girth 5 with a precolored cycle of length at most 16, that are used in thebasic case of the inductive proof of the statement.

4-critical graphs on surfaces without contractible (<=4)-cycles