2008 |
6 | EE | Stéphane Bessy,
Christophe Paul,
Anthony Perez:
Polynomial kernels for 3-leaf power graph modification problems
CoRR abs/0809.2858: (2008) |
2007 |
5 | EE | Stéphane Bessy,
Nicolas Lichiardopol,
Jean-Sébastien Sereni:
Two proofs of Bermond-Thomassen conjecture for regular tournaments.
Electronic Notes in Discrete Mathematics 28: 47-53 (2007) |
2006 |
4 | EE | Stéphane Bessy,
Frédéric Havet,
Etienne Birmelé:
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree.
Journal of Graph Theory 53(4): 315-332 (2006) |
2005 |
3 | EE | Stéphane Bessy,
Stéphan Thomassé:
The categorical product of two 5-chromatic digraphs can be 3-chromatic.
Discrete Mathematics 305(1-3): 344-346 (2005) |
2004 |
2 | EE | Stéphane Bessy,
Stéphan Thomassé:
Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs.
IPCO 2004: 132-138 |
2003 |
1 | EE | Stéphane Bessy,
Stéphan Thomassé:
Every strong digraph has a spanning strong subgraph with at most n+2 alpha-2 arcs.
J. Comb. Theory, Ser. B 87(2): 289-299 (2003) |