Hostname: page-component-7b7567c8c-9cwtv Total loading time: 0 Render date: 2026-11-19T21:20:56.472Z Has data issue: false hasContentIssue false

A Categorical Characterization of the Four Colour Theorem

Published online by Cambridge University Press:  20 November 2018

Barry Fawcett*
Affiliation:
Dept. of Mathematics Statistics and Computing Science Dalhousie University Halifax, N.S. B3H 3J5
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The surjectivity of epimorphisms in the category of planar graphs and edge-preserving maps follows from and is implied by the Four Colour Theorem. The argument that establishes the equivalence is not combinatorially complex.

Keywords

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1986