On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques (Q6084676): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:03, 10 July 2024
scientific article; zbMATH DE number 7761584
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques |
scientific article; zbMATH DE number 7761584 |
Statements
On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques (English)
0 references
6 November 2023
0 references
\(P_5\)-free graph
0 references
chromatic number
0 references
polynomial \(\chi\)-boundedness
0 references
intersecting cliques
0 references
