Abstract
We determine the rank and chromatic number of the complements of all Kasami graphs, some of which form an infinite family of counterexamples to the now disproven rank-coloring conjecture. (c) 2006 Elsevier B.V. All rights reserved.
Original language | English |
---|---|
Pages (from-to) | 132-136 |
Journal | Discrete Mathematics |
Volume | 307 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2007 |