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.
|Original language||English (US)|
|Number of pages||3|
|Journal||Journal of Graph Theory|
|State||Published - Sep 1989|
All Science Journal Classification (ASJC) codes
- Geometry and Topology