Graph colouring is a fundamental problem in both theoretical and applied combinatorics, with significant implications for computer science, operational research and network theory. At its essence, ...

A graph is called $n$-degenerate if each of its subgraphs has a vertex of degree at most $n$. For each $n$ the Lick-White number of graph $G$ is the fewest number of ...

A theorem for coloring a large class of “perfect” mathematical networks could ease the way for a long-sought general coloring proof. Four years ago, the mathematician Maria Chudnovsky faced an all-too ...