TL;DR
This paper provides a visually engaging overview of graph colouring, covering theoretical results and algorithms for node, edge, and face colouring, with applications across various domains.
Contribution
It offers a comprehensive, visually rich review of graph colouring topics, combining theory with illustrative figures to enhance understanding.
Findings
Reviewed key theoretical results in graph colouring
Presented algorithms for node, edge, and face colouring
Enhanced understanding through detailed visualizations
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Timetabling Solutions · Advanced Graph Theory Research · Constraint Satisfaction and Optimization