Proof of a conjectured lower bound on the chromatic number of a graph (Q745214): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.laa.2015.08.007 / rank | |||
| Property / cites work | |||
| Property / cites work: Q4040931 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Inequalities for the extreme eigenvalues of block-partitioned Hermitian matrices with applications to spectral graph theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Chromatic number and spectral radius / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.LAA.2015.08.007 / rank | |||
Normal rank | |||
Latest revision as of 02:54, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proof of a conjectured lower bound on the chromatic number of a graph |
scientific article |
Statements
Proof of a conjectured lower bound on the chromatic number of a graph (English)
0 references
13 October 2015
0 references
chromatic number
0 references
lower bound
0 references
