Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (Q1774164): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDPpack / rank | |||
Normal rank | |||
Revision as of 07:51, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring |
scientific article |
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
