Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10878-015-9929-z / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-015-9929-Z / rank | |||
Normal rank | |||
Latest revision as of 20:00, 9 December 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
