A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (Q2701401)
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; zbMATH DE number 7680789
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs |
scientific article; zbMATH DE number 7680789 |
Statements
A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (English)
0 references
28 April 2023
0 references
\(P_5\)-free
0 references
chromatic number
0 references
induced subgraph
0 references
