1 citations · 2 across the 6 of their papers we have counts for
1 paper · 2 filters
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…