ON PLANAR COLOURED GRAPHS
DOI:
https://doi.org/10.70153/Keywords:
Planar graph, near-triangulation, vertex coloring, chromatic number, 4-ColourableAbstract
In this paper we will work two proofs of the 4-Colour Theorem are presented which do not require the use of Computer Programs
Downloads
Published
Issue
Section
License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

