Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q269068 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:28, 5 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
