Characterizations of \((4 K_1,C_4,C_5)\)-free graphs (Q2403803)
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 6773898
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizations of \((4 K_1,C_4,C_5)\)-free graphs |
scientific article; zbMATH DE number 6773898 |
Statements
Characterizations of \((4 K_1,C_4,C_5)\)-free graphs (English)
0 references
12 September 2017
0 references
graph colouring
0 references
\((4K_1,C_4,C_5)\)-free graphs
0 references
perfect graphs
0 references
0.8473820686340332
0 references
0.8343507647514343
0 references
0.8289332389831543
0 references
0.8268259167671204
0 references
