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.
Original language | English (US) |
---|---|
Pages (from-to) | 523-525 |
Number of pages | 3 |
Journal | Journal of Graph Theory |
Volume | 13 |
Issue number | 4 |
DOIs | |
State | Published - Sep 1989 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Geometry and Topology