A polyhedral approach for the equitable coloring problem

Authors:
Isabel Méndez-Díaz;Graciela Nasini;Daniel Severín
Affiliations:
FCEyN, Universidad de Buenos Aires, Argentina;FCEIA, Universidad Nacional de Rosario, Argentina and CONICET, Argentina;FCEIA, Universidad Nacional de Rosario, Argentina and CONICET, Argentina
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 9
Cited 0

Equitable coloring of trees

Journal of Combinatorial Theory Series B
Equitable Coloring Extends Chernoff-Hoeffding Bounds

APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Conflict-free star-access in parallel memory systems

Journal of Parallel and Distributed Computing
A cutting plane algorithm for graph coloring

Discrete Applied Mathematics
A short proof of the hajnal–szemerédi theorem on equitable colouring

Combinatorics, Probability and Computing
On the asymmetric representatives formulation for the vertex coloring problem

Discrete Applied Mathematics
Packing and partitioning orbitopes

Mathematical Programming: Series A and B
The maximum k-colorable subgraph problem and orbitopes

Discrete Optimization
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this work we study the polytope associated with a 0,1-integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining inequalities. We also present computational evidence that shows the efficacy of these inequalities used in a cutting-plane algorithm.