A note on the approximation ratio of graph-coloring

MaRDI QIDQ3070863zbMATH OpenFDO

Authors Vangelis Th. Paschos

Publication date 28 January 2011

zbMATH Keywords

approximation rationminimum graph coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Polynomial approximation and graph-coloring
• Approximation results for the minimum graph coloring problem
• Approximate graph coloring by semidefinite programming
• A better performance guarantee for approximate graph coloring
• New approximation algorithms for graph coloring

Cited in

(4)

• Approximation results for the minimum graph coloring problem
• Polynomial approximation and graph-coloring
• scientific article; zbMATH DE number 2086377 (Why is no real title available?)
• A better performance guarantee for approximate graph coloring

This page was built for publication: A note on the approximation ratio of graph-coloring

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