A manual proof of the Four-colour Theorem

TL;DR

This paper presents a simplified proof of the Four-colour Theorem for a specific case, making the theorem more accessible for understanding and teaching.

Contribution

It offers a manual, simplified proof of the Four-colour Theorem in a particular case, diverging from computer-assisted proofs.

Findings

Proof is easier to understand and verify.

Applicable to a specific case of the theorem.

Demonstrates the potential for manual proofs in graph theory.

Abstract

In this paper, we provide an easy proof of the Four-colour Theorem in a special case indeed.