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 the normal view instead:
scientific article; zbMATH DE number 7680789
| 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; 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
0.8656970262527466
0 references
0.855073869228363
0 references
0.8516100645065308
0 references
0.8478737473487854
0 references
0.8448768854141235
0 references
