A Categorical Characterization of the Four Colour Theorem
Canadian mathematical bulletin, Tome 29 (1986) no. 4, pp. 426-431
Voir la notice de l'article provenant de la source Cambridge
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.
Fawcett, Barry. A Categorical Characterization of the Four Colour Theorem. Canadian mathematical bulletin, Tome 29 (1986) no. 4, pp. 426-431. doi: 10.4153/CMB-1986-067-8
@article{10_4153_CMB_1986_067_8,
author = {Fawcett, Barry},
title = {A {Categorical} {Characterization} of the {Four} {Colour} {Theorem}},
journal = {Canadian mathematical bulletin},
pages = {426--431},
year = {1986},
volume = {29},
number = {4},
doi = {10.4153/CMB-1986-067-8},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1986-067-8/}
}
Cité par Sources :