The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (Q2662887): 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/s00010-020-00760-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3095512288 / rank | |||
Normal rank | |||
Revision as of 18:06, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices |
scientific article |
Statements
The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (English)
0 references
15 April 2021
0 references
chromatic number
0 references
triangle-free graph
0 references
broom-free graph
0 references
