scientific article

zbMath1274.90452MaRDI QIDQ2861516

Philippe Meurdesoif, Denis Cornaz

Publication date: 8 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001228

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Chromatic Gallai identities operating on Lovász number

Cites Work

• Semidefinite programming relaxations for graph coloring and maximal clique problems
• Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A one-to-one correspondence between colorings and stable sets
• Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
• The fractional chromatic number of mycielski's graphs

This page was built for publication: