# Graph colouring algorithms

arXiv: https://arxiv.org/abs/1505.05825 · HTML: https://mlsanity.com/paper/1505.05825/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 21 May 2015.

## Built on by (most cited first, 2 of 2)

- [Federated Learning over Wireless Device-to-Device Networks: Algorithms and Convergence Analysis](https://mlsanity.com/paper/2101.12704/) (2021)
- [GFlowNets for Hamiltonian decomposition in groups of compatible operators](https://mlsanity.com/paper/2410.16041/) (2024)

## Abstract (arXiv)

This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available techniques and is organized by algorithmic paradigm.