Polyhedral results for the Equitable Coloring Problem

DOI10.1016/j.endm.2011.05.028zbMath1268.90065arXiv1106.3349OpenAlexW2104138465MaRDI QIDQ2840701

Daniel Severín, Isabel Méndez-Díaz, Graciela L. Nasini

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.3349

zbMATH Keywords

integer programmingbranch \& cutequitable graph coloring

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)

Cites Work

• A cutting plane algorithm for graph coloring
• On the asymmetric representatives formulation for the vertex coloring problem
• A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives
• Equitable Coloring
• Graph Colorings

This page was built for publication: Polyhedral results for the Equitable Coloring Problem