A counterexample to the rank‐coloring conjecture
- 1 September 1989
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 13 (4) , 523-525
- https://doi.org/10.1002/jgt.3190130413
Abstract
It has been conjectured by C. van Nuffelen that the chromatic number of any graph with at least one edge does not exceed the rank of its adjacency matrix. We give a counterexample, with chromatic number 32 and with an adjacency matrix of rank 29.Keywords
This publication has 2 references indexed in Scilit:
- A Bound for the Chromatic Number of a GraphThe American Mathematical Monthly, 1976
- A Bound for the Chromatic Number of a GraphThe American Mathematical Monthly, 1976