On the public citation graph

Proof of four color theorem - a logical method

0 signed · 6 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jctb.1997.1750openalex-extracted

The Four-Colour Theorem

inferredcites →https://doi.org/10.1007/978-1-4612-2972-8_13openalex-extracted

Kempe Chains and the Four Colour Problem

inferredcites →https://doi.org/10.1215/ijm/1256049011openalex-extracted

Every planar map is four colorable. Part I: Discharging

inferredcites →https://doi.org/10.1215/ijm/1256049012openalex-extracted

Every planar map is four colorable. Part II: Reducibility

inferredcites →https://doi.org/10.2307/2369235openalex-extracted

On the Geographical Problem of the Four Colours

inferredcites →https://doi.org/10.2307/2370276openalex-extracted

The Reducibility of Maps

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.