GCol: A high-performance Python library for graph colouring

Lewis, Rhyd ORCID: https://orcid.org/0000-0003-1046-811X and Palmer, Geraint ORCID: https://orcid.org/0000-0001-7865-6964 2025. GCol: A high-performance Python library for graph colouring. The Journal of Open Source Software 10 (108) , 7871. 10.21105/joss.07871

Preview

PDF - Published Version Available under License Creative Commons Attribution. Download (813kB) | Preview

Abstract

Graph colouring is the computational problem of assigning colours to entities of a graph so that adjacent entities receive different colours. The aim is to use as few colours as possible. In general terms, a graph is a mathematical object comprising a set of nodes and a set of edges that join pairs of nodes. Graphs are also known as networks, nodes as vertices, and edges as links. Examples of graph colouring are shown in Figure 1, which help to demonstrate the following principles.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Schools > Mathematics
Publisher:	Open Journals
ISSN:	2475-9066
Date of First Compliant Deposit:	3 April 2025
Date of Acceptance:	2 April 2025
Last Modified:	16 Apr 2025 15:00
URI:	https://orca.cardiff.ac.uk/id/eprint/177374

Actions (repository staff only)

Edit Item