| Article ID: | iaor19931471 |
| Country: | Belgium |
| Volume: | 31 |
| Start Page Number: | 91 |
| End Page Number: | 109 |
| Publication Date: | Dec 1991 |
| Journal: | Belgian Journal of Operations Research, Statistics and Computer Science |
| Authors: | Trappers Dirk |
Alan and Seymour’s procedure is extended to find a counterexample of the Rank-Colouring conjecture, which was proposed by van Nuffelen. This conjecture states that the rank of the incidence matrix of a graph is an upper bound for the chromatic number of that graph.