Coloring vertices of a graph or finding a Meyniel obstruction (Q418741)
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 6039148
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coloring vertices of a graph or finding a Meyniel obstruction |
scientific article; zbMATH DE number 6039148 |
Statements
Coloring vertices of a graph or finding a Meyniel obstruction (English)
0 references
30 May 2012
0 references
perfect graphs
0 references
Meyniel graphs
0 references
coloring
0 references
strong stable set
0 references
existentially polytime theorem
0 references
0.8900301456451416
0 references
0.8419012427330017
0 references
0.8258099555969238
0 references
0.8236700892448425
0 references
0.8236696720123291
0 references
