A tight linear bound to the chromatic number of $(P_5, K_1+(K_1\cup K_3))$-free graphs (Q6399370)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A tight linear bound to the chromatic number of $(P_5, K_1+(K_1\cup K_3))$-free graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight linear bound to the chromatic number of $(P_5, K_1+(K_1\cup K_3))$-free graphs |
scientific article |
Statements
17 May 2022
0 references
math.CO
0 references
