Chromatic number and the 2-rank of a graph
type: Item
instance of: scholarly article
title: Chromatic number and the 2-rank of a graph
zbMATH Open document ID: 1026.05046
published in: Journal of Combinatorial Theory. Series B
publication date: 2002-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 1843743
zbMATH Keywords: adjacency matrix
zbMATH Keywords: bound
author: Chris Godsil
author: Gordon Royle
MaRDI profile type: Publication
full work available at URL: jctb.2000.2003
OpenAlex ID: W2066522339
cites work: A counterexample to the rank-coloring conjecture
cites work: Q4286076
cites work: Q3775591
cites work: ON EIGENVALUES AND COLORINGS OF GRAPHS, II
cites work: Q3955544
cites work: The rank and size of graphs
cites work: Rank and chromatic number of a graph
cites work: Orthogonal representations over finite fields and the chromatic number of graphs
cites work: On the ``log rank''-conjecture in communication complexity
cites work: The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear
cites work: Simple Lie algebras and graphs
cites work: Q4023227
cites work: Characterizations of certain classes of graphs
cites work: Q4862337
cites work: Q4004234
cites work: Ovoids and spreads of finite classical polar spaces
cites work: Q3041228
DOI: 10.1006/JCTB.2000.2003
description: scientific article; zbMATH DE number 1843743