Chromatic number and the 2-rank of a graph (Q1850515): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1006/jctb.2000.2003 / rank | |||
Property / author | |||
Property / author: Q933676 / rank | |||
Property / author | |||
Property / author: Gordon F. Royle / rank | |||
Property / author | |||
Property / author: Chris D. Godsil / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Gordon F. Royle / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/jctb.2000.2003 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2066522339 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A counterexample to the rank-coloring conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4286076 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3775591 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ON EIGENVALUES AND COLORINGS OF GRAPHS, II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3955544 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The rank and size of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rank and chromatic number of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Orthogonal representations over finite fields and the chromatic number of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the ``log rank''-conjecture in communication complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Simple Lie algebras and graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4023227 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characterizations of certain classes of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4862337 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4004234 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ovoids and spreads of finite classical polar spaces / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3041228 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1006/JCTB.2000.2003 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:29, 16 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Chromatic number and the 2-rank of a graph |
scientific article |
Statements
Chromatic number and the 2-rank of a graph (English)
0 references
10 December 2002
0 references
adjacency matrix
0 references
bound
0 references
0 references