On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques (Q6084676): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-023-01088-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4387654926 / rank | |||
Normal rank | |||
Revision as of 11:57, 30 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
