Browsing Mathematics (Faculty of) by Subject "balanced skew partition"
Now showing items 1-1 of 1
-
Colouring perfect graphs with bounded clique number
(Elsevier, 2017-01)A graph is perfect if the chromatic number of every induced subgraph equals the size of its largest clique, and an algorithm of Grötschel, Lovász, and Schrijver [9] from 1988 finds an optimal colouring of a perfect graph ...