Article ID Journal Published Year Pages File Type
4651106 Discrete Mathematics 2007 5 Pages PDF
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.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, ,