The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear
- 1 October 1992
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 108 (1-3) , 393-396
- https://doi.org/10.1016/0012-365x(92)90691-8
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- A counterexample to the rank‐coloring conjectureJournal of Graph Theory, 1989
- Some complexity questions related to distributive computing(Preliminary Report)Published by Association for Computing Machinery (ACM) ,1979