Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (Q1774164)

From MaRDI portal
Revision as of 09:01, 27 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    29 April 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Combinatorial optimization
    0 references
    SDP relaxation
    0 references
    Graph coloring
    0 references
    Lovász \(\theta\)-number
    0 references