Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1026.05046
Godsil, C.D.; Royle, Gordon F.
Chromatic number and the 2-rank of a graph. (English)
[J] J. Comb. Theory, Ser. B 81, No.1, 142-149 (2001). ISSN 0095-8956

Summary: We show that if the adjacency matrix of a graph $X$ has 2-rank $2r$, then the chromatic number of $X$ is at most $2^r+ 1$, and that this bound is tight.

MSC 2000:: *05C15 Chromatic theory of graphs and maps
05C50 Graphs and matrices

Keywords: adjacency matrix; bound

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]