A clique-colouring of a graph G is a colouring of the vertices of G so that no maximal clique
of size at least two is monochromatic. The clique-hypergraph, H (G), of a graph G has V (G) …

Given an undirected graph $ G=(V, E) $(ie the conflict graph) where $ V $ is a set of $ n $
vertices (representing the jobs), processing times $ p\colon V\to\mathbb {Z} _> $, and …

For a graph G and its complement Ḡ, we define the graph coloring polytope P (G) to be the
convex hull of the incidence vectors of star partitions of Ḡ. We examine inequalities whose …

A k-fold x-coloring of a graph is an assignment of (at least) k distinct colors from the set {1,
2,…, x} to each vertex such that any two adjacent vertices are assigned disjoint sets of …

A linear description of the stable set polytope STAB (G) of a quasi-line graph G is given in
Eisenbrand et al.(Combinatorica 28 (1): 45–67, 2008), where the so called Ben Rebea …

A k-fold x-coloring of a graph G is an assignment of (at least) k distinct colors from the set {1,
2,…, x} to each vertex such that any two adjacent vertices are assigned disjoint sets of …

While the Ben Rebea Theorem provides a complete linear description of the stable set
polytope of quasi-line graphs, no minimal description is currently available. In this paper, we …

At Play with Combinatorial Optimization, Integer Programming and Polyhedra Page 1 HAL Id:
tel-00653059 https://theses.hal.science/tel-00653059 Submitted on 17 Dec 2011 HAL is a …

December 1, 2012. I am certain that all of you feel the same way as I do about the Berlin
ISMP 2012: what a fantastic meeting! Among many highlights, let me (very subjectively) …

A clique-colouring of a graph G is a colouring of the vertices of G so that no maximal clique
of size at least two is monochromatic. The clique-hypergraph, H (G), of a graph G has V (G) …