Year: 2025
Type: article
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.
DOI: 10.21105/joss.07871
Authors: Rhyd Lewis, Geraint Palmer
Institution: Cardiff University
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4409110350