Graph colouring: a visual tour

Lewis, Rhydian ORCID: https://orcid.org/0000-0003-1046-811X 2026. Graph colouring: a visual tour. 2602.1 Cornell University. 10.48550/arXiv.2602.18246

Preview

PDF - Submitted Pre-Print Version Available under License Creative Commons Attribution. Download (1MB) | Preview

Abstract

Graph colouring is a combinatorial optimisation problem with applications in several important domains, including sports scheduling, cartography, street map navigation, and timetabling. It is also of significant theoretical interest and a standard subject in university-level courses on graph theory, algorithms, and combinatorics. In this paper, we consider the topics of node, edge, and face colouring along with their associated algorithms. Theoretical results are reviewed and brought to life through a collection of detailed, visually engaging figures designed to enhance understanding and appeal.

Item Type:	Working paper
Date Type:	Published Online
Status:	Submitted
Schools:	Schools > Mathematics
Publisher:	Cornell University
Date of Acceptance:	20 February 2026
Last Modified:	05 Mar 2026 16:35
URI:	https://orca.cardiff.ac.uk/id/eprint/185450

Actions (repository staff only)

Edit Item