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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, two recursion formulae of chromatic polynomial of a maximalplanar graph G are obtained. Moreover, the application of these formulaes tothe proof of Four-Color Conjecture is investigated. By using these formulae,the proof of Four-Color Conjecture boils down to the study on a special classof graphs, viz., 4-chromatic-funnel pseudo uniquely-4-colorable maximal planargraphs.

Theory on the Structure and Coloring of Maximal Planar Graphs (1)Recursion Formulae of Chromatic Polynomial and Four-Color Conjecture