Search the dblp DataBase

Publications of Author

1. Frédéric Havet
   Design of Fault Tolerant Satellite Networks with Priorities via Selectors. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2002, pp:165-179 [Conf]
   
2. Frédéric Havet, Marc Wennink
   The push tree problem. [Citation Graph (0, 0)][DBLP]
   SPAA, 2001, pp:318-319 [Conf]
   
3. Frédéric Havet, Jean-Sébastien Sereni
   Channel Assignment and Improper Choosability of Graphs. [Citation Graph (0, 0)][DBLP]
   WG, 2005, pp:81-90 [Conf]
   
4. Stéphan Ceroi, F. Havet
   Trees with three leaves are (n+1)-unavoidable. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:19-39 [Journal]
   
5. Frédéric Havet
   Stable set meeting every longest path. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:289, n:1-3, pp:169-173 [Journal]
   
6. Frédéric Havet
   Trees in tournaments. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:243, n:1-3, pp:121-134 [Journal]
   
7. Frédéric Havet, Janez Zerovnik
   Finding a five bicolouring of a triangle-free subgraph of the triangular lattice. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:244, n:1-3, pp:103-108 [Journal]
   
8. Frédéric Havet
   Channel assignment and multicolouring of the induced subgraphs of the triangular lattice. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:233, n:1-3, pp:219-231 [Journal]
   
9. Frédéric Havet
   Finding an Oriented Hamiltonian Path in a Tournament. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2000, v:36, n:2, pp:253-275 [Journal]
   
10. Frédéric Havet
    Oriented Hamiltonian Cycles in Tournaments. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:80, n:1, pp:1-31 [Journal]
    
11. Frédéric Havet, Stéphan Thomassé
    Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:78, n:2, pp:243-273 [Journal]
    
12. Frédéric Havet, Marc Wennink
    The Push Tree problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:4, pp:281-291 [Journal]
    
13. Frédéric Havet, Jean-Sébastien Sereni
    Improper choosability of graphs and maximum average degree. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:52, n:3, pp:181-199 [Journal]
    
14. Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé
    WDM and Directed Star Arboricity [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
    
15. Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski
    3-facial colouring of plane graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
    
16. Louigi Addario-Berry, Frédéric Havet, Stéphan Thomassé
    Paths with two blocks in n-chromatic digraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:4, pp:620-626 [Journal]
    
17. 
    L(2, 1)-labelling of graphs. [Citation Graph (, )][DBLP]
    
    
18. 
    Complexity of (p, 1)-total labelling. [Citation Graph (, )][DBLP]
    
    
19. 
    k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4. [Citation Graph (, )][DBLP]
    
    
20. 
    (p, 1)-Total labelling of graphs. [Citation Graph (, )][DBLP]
    
    
21. 
    Hoàng-Reed conjecture holds for tournaments. [Citation Graph (, )][DBLP]
    
    
22. 
    Choosability of the square of planar subcubic graphs with large girth. [Citation Graph (, )][DBLP]
    
    
23. 
    Grundy number and products of graphs. [Citation Graph (, )][DBLP]
    
    
24. 
    Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof. [Citation Graph (, )][DBLP]
    
    
25. 
    Corrigendum to "(p, 1)-total labelling of graphs" [Discrete Mathematics 308 (2008) 496-513]. [Citation Graph (, )][DBLP]
    
    
26. 
    Facial colorings using Hall's Theorem. [Citation Graph (, )][DBLP]