Finite Three-Colourable (0,2)-Graphs Are Bipartite

Christopher Williamson

A theorem of Payan says that a cubelike graph cannot have chromatic number exactly three. A nearby question, usually discussed as Payan's finite $(0,2)$-graph question, asks whethe…