Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457)
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: Semidefinite programming relaxations for graph coloring and maximal clique problems |
scientific article; zbMATH DE number 5131068
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semidefinite programming relaxations for graph coloring and maximal clique problems |
scientific article; zbMATH DE number 5131068 |
Statements
Semidefinite programming relaxations for graph coloring and maximal clique problems (English)
0 references
5 March 2007
0 references
Lovász theta number
0 references
chromatic number
0 references
clique number
0 references
cutting planes
0 references
0 references
0 references
0 references
0 references
0 references
