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, ...

Vol. 12, No. 4, Dedicated to Professor Ko-Wei Lih on the Occasion of His 60th Birthday (July 2008), pp. 997-1005 (9 pages) The circular chromatic number χc(G) of a graph G is a very natural ...

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 ...

Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at the ...