scientific article; zbMATH DE number 2166870

zbMATH Open1064.05055MaRDI QIDQ4674151FDOQ4674151

Franz Rendl, Igor Dukanovic

Publication date: 9 May 2005

Title of this publication is not available (Why is that?)

Recommendations

• Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring
• Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
• Computational Experience with Stable Set Relaxations
• Copositive programming motivated bounds on the stability and the chromatic numbers
• Lower bounds for measurable chromatic numbers

zbMATH Keywords

relaxationsLovász number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (5)

• Bounds for the chromatic number of graphs with partial information
• Improving lower bounds for equitable chromatic number
• Title not available (Why is that?)
• On bounding the chromatic number of L-graphs
• Chromatic number versus chromatic number in graphs with bounded clique number

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4674151)