Integer and combinatorial optimization
Integer and combinatorial optimization
The fractional chromatic number of Mycielski's graphs
Journal of Graph Theory
On the asymmetric representatives formulation for the vertex coloring problem
Discrete Applied Mathematics
On the recursive largest first algorithm for graph colouring
International Journal of Computer Mathematics
A one-to-one correspondence between colorings and stable sets
Operations Research Letters
A branch-and-price approach for the partition coloring problem
Operations Research Letters
Cycle-based facets of chromatic scheduling polytopes
Discrete Optimization
On optimal k-fold colorings of webs and antiwebs
Discrete Applied Mathematics
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
Discrete Applied Mathematics
| Hi-index | 0.89 |
Certain subgraphs of a given graph G restrict the minimum number χ(G) of colors that can be assigned to the vertices of G such that the endpoints of all edges receive distinct colors. Some of such subgraphs are related to the celebrated Strong Perfect Graph Theorem, as it implies that every graph G contains a clique of size χ(G), or an odd hole or an odd anti-hole as an induced subgraph. In this paper, we investigate the impact of induced maximal cliques, odd holes and odd anti-holes on the polytope associated with a new 0-1 integer programming formulation of the graph coloring problem. We show that they induce classes of facet defining inequalities.