Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture F Havet, S Thomassé
Journal of Graph Theory 35 (4), 244-256, 2000
98 2000 List colouring squares of planar graphs F Havet, J Van Den Heuvel, C McDiarmid, B Reed
Electronic Notes in Discrete Mathematics 29, 515-519, 2007
85 2007 Improper choosability of graphs and maximum average degree F Havet, JS Sereni
Journal of Graph Theory 52 (3), 181-199, 2006
74 2006 (p, 1)-total labelling of graphs F Havet, ML Yu
Discrete mathematics 308 (4), 496-513, 2008
73 2008 L (2, 1)-labelling of graphs F Havet, B Reed, JS Sereni
ACM-SIAM symposium on Discrete algorithms (SODA 2008), 621-630, 2008
71 2008 Bisimplicial vertices in even-hole-free graphs L Addario-Berry, M Chudnovsky, F Havet, B Reed, P Seymour
Journal of Combinatorial Theory, Series B 98 (6), 1119-1164, 2008
67 2008 Oriented Hamiltonian paths in tournaments: a proof of Rosenfeld's conjecture F Havet, S Thomasse
Journal of Combinatorial Theory, Series B 78 (2), 243-273, 2000
67 2000 Channel assignment and multicolouring of the induced subgraphs of the triangular lattice F Havet
Discrete Mathematics 233 (1-3), 219-231, 2001
62 2001 On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems S Guillemot, F Havet, C Paul, A Perez
Algorithmica 65, 900-926, 2013
60 2013 Acyclic edge-coloring of planar graphs M Basavaraju, LS Chandran, N Cohen, F Havet, T Müller
SIAM Journal on Discrete Mathematics 25 (2), 463-478, 2011
48 2011 Oriented trees in digraphs L Addario-Berry, F Havet, CL Sales, B Reed, S Thomassé
Discrete Mathematics 313 (8), 967-974, 2013
46 2013 Griggs and Yeh's Conjecture and F Havet, B Reed, JS Sereni
SIAM Journal on Discrete Mathematics 26 (1), 145-168, 2012
44 2012 Choosability of the square of planar subcubic graphs with large girth F Havet
Discrete mathematics 309 (11), 3553-3563, 2009
37 2009 Improper coloring of unit disk graphs F Havet, RJ Kang, JS Sereni
Networks: An International Journal 54 (3), 150-164, 2009
36 2009 Subdivisions in digraphs of large out-degree or large dichromatic number P Aboulker, N Cohen, F Havet, W Lochet, PFS Moura, S Thomassé
arXiv preprint arXiv:1610.00876, 2016
35 2016 Exact Algorithms for L (2,1)-Labeling of Graphs F Havet, M Klazar, J Kratochvíl, D Kratsch, M Liedloff
Algorithmica 59, 169-194, 2011
35 2011 Grundy number and products of graphs M Asté, F Havet, C Linhares-Sales
Discrete Mathematics 310 (9), 1482-1490, 2010
35 2010 Weighted improper colouring J Araujo, JC Bermond, F Giroire, F Havet, D Mazauric, R Modrzejewski
Journal of Discrete Algorithms 16, 53-66, 2012
34 2012 On the Grundy and b -Chromatic Numbers of a Graph F Havet, L Sampaio
Algorithmica 65, 885-899, 2013
32 2013 Paths with two blocks in L Addario-Berry, S Thomassé, F Havet
INRIA, 2005
32 2005 