Charles Explorer logo
🇬🇧

A dualistic approach to bounding the chromatic number of a graph

Publication at Faculty of Mathematics and Physics |
2008

Abstract

Proves a surprising results about the chromatic number of duals.