Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863): 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.1007/s10878-015-9929-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1063412800 / rank | |||
Normal rank | |||
Revision as of 01:42, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree |
scientific article |
Statements
Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (English)
0 references
3 March 2017
0 references
chromatic number
0 references
triangle-free graph
0 references
induced subgraph
0 references
forbidden subgraph
0 references
