On chromatic number of graphs without certain induced subgraphs. (Q2918532)
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 6092180
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On chromatic number of graphs without certain induced subgraphs. |
scientific article; zbMATH DE number 6092180 |
Statements
8 October 2012
0 references
\(F\)-free graph
0 references
perfect graph
0 references
graph divisibility
0 references
On chromatic number of graphs without certain induced subgraphs. (English)
0 references
0.894599199295044
0 references
0.8636226654052734
0 references
0.8438612818717957
0 references
