-
The chromatic number of almost stable Kneser hypergraphs
International audience -
Improper colouring of (random) unit disk graphs
For any graph $G$, the $k$-improper chromatic number $\chi^k(G)$ is the smallest number of colours used in a colouring of $G$ such that each colour class induces a... -
Paths with two blocks in $n$-chromatic digraphs
We show that every oriented path of order $n\geq4$ with two blocks is contained in every $n$-chromatic digraph. -
Directed acyclic graphs with the unique dipath property
International audience -
A Tight Bound on the Set Chromatic Number
International audience -
Semidefinite programming in combinatorial optimization with applications to c...
We apply the semidefinite programming method to obtain a new upper bound on the cardinality of codes made of subspaces of a linear vector space over a finite field.... -
Coloring Geographical Threshold Graphs
Graphs and Algorithms
