Note: Facet-inducing web and antiweb inequalities for the graph coloring polytope

Authors:
Gintaras Palubeckis
Affiliations:
-
Venue:
Discrete Applied Mathematics
Year:
2010

Citing 13
Cited 1

On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes

SIAM Journal on Discrete Mathematics
Pseudo-boolean optimization

Discrete Applied Mathematics
Clique family inequalities for the stable set polytope of quasi-line graphs

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Exploring the Relationship Between Max-Cut and Stable Set Relaxations

Mathematical Programming: Series A and B
A construction for non-rank facets of stable set polytopes of webs

European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
On the asymmetric representatives formulation for the vertex coloring problem

Discrete Applied Mathematics
The stable set polytope of quasi-line graphs

Combinatorica
Clique-circulants and the stable set polytope of fuzzy circular interval graphs

Mathematical Programming: Series A and B
On the recursive largest first algorithm for graph colouring

International Journal of Computer Mathematics
A class of web-based facets for the generalized vertex packing problem

Discrete Applied Mathematics
On packing and covering polyhedra of consecutive ones circulant clutters

Discrete Applied Mathematics
A one-to-one correspondence between colorings and stable sets

Operations Research Letters
Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results

Discrete Optimization

On optimal k-fold colorings of webs and antiwebs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

For a graph G and its complement G@?, we define the graph coloring polytope P(G) to be the convex hull of the incidence vectors of star partitions of G@?. We examine inequalities whose support graphs are webs and antiwebs appearing as induced subgraphs in G. We show that for an antiweb W@? in G the corresponding inequality is facet-inducing for P(G) if and only if W@? is critical with respect to vertex colorings. An analogous result is also proved for the web inequalities.