Search the dblp DataBase

Publications of Author

1. Stéphane Bessy, Stéphan Thomassé
   Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs. [Citation Graph (0, 0)][DBLP]
   IPCO, 2004, pp:132-138 [Conf]
   
2. Stéphane Bessy, Stéphan Thomassé
   The categorical product of two 5-chromatic digraphs can be 3-chromatic. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:305, n:1-3, pp:344-346 [Journal]
   
3. Stéphane Bessy, Stéphan Thomassé
   Every strong digraph has a spanning strong subgraph with at most n+2 alpha-2 arcs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:289-299 [Journal]
   
4. Stéphane Bessy, F. Havet, Etienne Birmelé
   Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree. [Citation Graph (0, 0)][DBLP]
   Journal of Graph Theory, 2006, v:53, n:4, pp:315-332 [Journal]
   
5. 
   Kernels for Feedback Arc Set In Tournaments. [Citation Graph (, )][DBLP]
   
   
6. 
   Polynomial Kernels for 3-Leaf Power Graph Modification Problems. [Citation Graph (, )][DBLP]
   
   
7. 
   Spanning a strong digraph by alpha circuits: A proof of Gallai's conjecture. [Citation Graph (, )][DBLP]
   
   
8. 
   Polynomial kernels for 3-leaf power graph modification problems [Citation Graph (, )][DBLP]
   
   
9. 
   Kernels for Feedback Arc Set In Tournaments [Citation Graph (, )][DBLP]
   
   
10. 
    Polynomial kernels for 3-leaf power graph modification problems. [Citation Graph (, )][DBLP]
    
    
11. 
    Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree. [Citation Graph (, )][DBLP]