Proof of a conjectured lower bound on the chromatic number of a graph (Q745214): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.laa.2015.08.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1149759637 / rank | |||
Normal rank | |||
Revision as of 22:24, 19 March 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
