Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (Q1774164)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Strengthening the Lovász ( G) bound for graph coloring |
scientific article; zbMATH DE number 2162522
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring |
scientific article; zbMATH DE number 2162522 |
Statements
Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (English)
0 references
29 April 2005
0 references
Combinatorial optimization
0 references
SDP relaxation
0 references
Graph coloring
0 references
Lovász \(\theta\)-number
0 references
0 references
0 references
0.8848145
0 references
0 references
0.87830955
0 references
0.8773794
0 references
0.87718713
0 references
0.87668985
0 references
0 references
0.87591183
0 references
