F. Havet

Most-cited papers

1. On the (Non-)Existence of Polynomial Kernels for Pl-Free Edge Modification Problems

   Sylvain Guillemot, F. Havet, C. Paul, Anthony Perez

   2010Algorithmica91 citations Open access

   Semantic Scholar

   Save

2. Oriented trees in digraphs

   L. Addario-Berry, F. Havet, C. Sales, B. Reed +1 more

   2013Discrete Mathematics59 citations Open access

   Semantic Scholar

   Save

3. Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number

   Pierre Aboulker, N. Cohen, F. Havet, William Lochet +2 more

   2016Electronic Journal of Combinatorics38 citations Open access

   Semantic Scholar

   Save

4. Griggs and Yeh's Conjecture and L(p, 1)-labelings

   F. Havet, B. Reed, Jean-Sébastien Sereni

   2012SIAM Journal on Discrete Mathematics38 citations

   Semantic Scholar

   Save

5. On the Grundy and b-Chromatic Numbers of a Graph

   F. Havet, L. Sampaio

   2013Algorithmica33 citations Open access

   Semantic Scholar

   Save

6. Facial non‐repetitive edge‐coloring of plane graphs

   F. Havet, S. Jendrol', R. Soták, E. Škrabul'áková

   2011Journal of Graph Theory33 citations Open access

   Semantic Scholar

   Save

7. Weighted improper colouring

   J. Araújo, J. Bermond, F. Giroire, F. Havet +2 more

   2011J. Discrete Algorithms32 citations Open access

   Semantic Scholar

   Save

8. B-coloring of Tight Graphs

   F. Havet, C. Sales, L. Sampaio

   2012Discrete Applied Mathematics31 citations Open access

   Semantic Scholar

   Save

9. Circular choosability

   F. Havet, Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni

   2009Journal of Graph Theory29 citations Open access

   Semantic Scholar

   Save

10. Subdivisions of oriented cycles in digraphs with large chromatic number

    N. Cohen, F. Havet, William Lochet, Nicolas Nisse

    2016Journal of Graph Theory25 citations Open access

    Semantic Scholar

    Save

11. Grundy number and products of graphs

    M. Asté, F. Havet, Cláudia Linhares-Sales

    2010Discrete Mathematics24 citations Open access

    Semantic Scholar

    Save

12. A variant of the Erdős‐Sós conjecture

    F. Havet, B. Reed, M. Stein, David R. Wood

    2016Journal of Graph Theory23 citations Open access

    Semantic Scholar

    Save

13. Proper orientation of cacti

    J. Araújo, F. Havet, C. Sales, Ana Silva

    2016Theoretical Computer Science22 citations Open access

    Semantic Scholar

    Save

14. On the inversion number of oriented graphs

    J. Bang-Jensen, Jonas Costa Ferreira da Silva, F. Havet

    2021Discrete Mathematics & Theoretical Computer Science21 citations Open access

    Semantic Scholar

    Save

15. Finding good 2-partitions of digraphs II. Enumerable properties

    J. Bang-Jensen, N. Cohen, F. Havet

    2016Theoretical Computer Science21 citations Open access

    Semantic Scholar

    Save

16. On the proper orientation number of bipartite graphs

    J. Araújo, N. Cohen, Susanna F. de Rezende, F. Havet +1 more

    2014Theoretical Computer Science21 citations Open access

    Semantic Scholar

    Save

17. Tournaments and Semicomplete Digraphs

    J. Bang-Jensen, F. Havet

    2018Classes of Directed Graphs20 citations

    Semantic Scholar

    Save

18. Problems, proofs, and disproofs on the inversion number

    Guillaume Aubian, F. Havet, Florian Hörsch, Felix Kingelhoefer +3 more

    2022Electronic Journal of Combinatorics19 citations Open access

    Semantic Scholar

    Save

19. On the unavoidability of oriented trees

    François Dross, F. Havet

    2018Latin-American Algorithms, Graphs and Optimization Symposium19 citations Open access

    Semantic Scholar

    Save

20. The game Grundy number of graphs

    F. Havet, Xu-Ding Zhu

    2012Journal of combinatorial optimization18 citations Open access

    Semantic Scholar

    Save

21. Steinberg's Conjecture and near-colorings

    G. Chang, F. Havet, M. Montassier, A. Raspaud

    201118 citations

    Semantic Scholar

    Save

22. Planar graphs with maximum degree ? = 9 are ( ? + 1 ) -edge-choosableA short proof

    N. Cohen, F. Havet

    201018 citations

    Semantic Scholar

    Save

23. k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4

    Nicole Eggemann, F. Havet, S. D. Noble

    2009Discrete Applied Mathematics18 citations Open access

    Semantic Scholar

    Save

24. Compressing Two-dimensional Routing Tables with Order

    F. Giroire, F. Havet, J. Moulierac

    2016Electron. Notes Discret. Math.17 citations Open access

    Semantic Scholar

    Save

25. Coloring Graphs with Constraints on Connectivity

    Pierre Aboulker, Nick Brettell, F. Havet, Dániel Marx +1 more

    2015Journal of Graph Theory17 citations Open access

    Semantic Scholar

    Save

26. Improper coloring of unit disk graphs

    F. Havet, Ross J. Kang, Jean-Sébastien Sereni

    2009Networks17 citations

    Semantic Scholar

    Save

27. Powers of paths in tournaments

    Nemanja Draganić, François Dross, Jacob Fox, António Girão +6 more

    2020Combinatorics, probability & computing16 citations Open access

    Semantic Scholar

    Save

28. Acyclic edge-colorings of planar graphs

    Manu Basavaraju, S. Chandran, N. Cohen, F. Havet +1 more

    201116 citations

    Semantic Scholar

    Save

29. Detection number of bipartite graphs and cubic graphs

    F. Havet, N. Paramaguru, Rathinasamy Sampathkumar

    2014Discrete Mathematics & Theoretical Computer Science14 citations Open access

    Semantic Scholar

    Save

30. Finding an induced subdivision of a digraph

    J. Bang-Jensen, F. Havet, Nicolas Trotignon

    2011Electron. Notes Discret. Math.14 citations Open access

    Semantic Scholar

    Save

31. On the Grundy Number of a Graph

    F. Havet, L. Sampaio

    2010International Symposium on Parameterized and Exact Computation14 citations

    Semantic Scholar

    Save

32. χ‐bounded families of oriented graphs

    Pierre Aboulker, J. Bang-Jensen, N. Bousquet, Pierre Charbit +3 more

    2016Journal of Graph Theory13 citations Open access

    Semantic Scholar

    Save

33. Finding a subdivision of a digraph

    J. Bang-Jensen, F. Havet, A. K. Maia

    2015Theoretical Computer Science13 citations Open access

    Semantic Scholar

    Save

34. About a Brooks-type theorem for improper colouring

    R. Corrêa, F. Havet, Jean-Sébastien Sereni

    2009The Australasian Journal of Combinatorics13 citations

    Semantic Scholar

    Save

35. Finding good 2-partitions of digraphs I. Hereditary properties

    J. Bang-Jensen, F. Havet

    2016Theoretical Computer Science12 citations Open access

    Semantic Scholar

    Save

36. (Circular) backbone colouring: Forest backbones in planar graphs

    F. Havet, Andrew D. King, M. Liedloff, Ioan Todinca

    2014Discrete Applied Mathematics12 citations Open access

    Semantic Scholar

    Save

37. Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2

    J. Bang-Jensen, S. Bessy, F. Havet, Anders Yeo

    2020Journal of Graph Theory11 citations Open access

    Semantic Scholar

    Save

38. Spanning eulerian subdigraphs in semicomplete digraphs

    J. Bang-Jensen, F. Havet, Anders Yeo

    2019Journal of Graph Theory11 citations Open access

    Semantic Scholar

    Save

39. On disjoint directed cycles with prescribed minimum lengths

    F. Havet, A. K. Maia

    201311 citations

    Semantic Scholar

    Save

40. Improper Coloring of Weighted Grid and Hexagonal Graphs

    J. Bermond, F. Havet, Florian Huc, C. Sales

    2010Discret. Math. Algorithms Appl.11 citations Open access

    Semantic Scholar

    Save

41. On the semi-proper orientations of graphs

    Ali Dehghan, F. Havet

    2019Discrete Applied Mathematics10 citations Open access

    Semantic Scholar

    Save

42. Out-degree reducing partitions of digraphs

    J. Bang-Jensen, S. Bessy, F. Havet, Anders Yeo

    2017Theoretical Computer Science10 citations Open access

    Semantic Scholar

    Save

43. The complexity of finding arc-disjoint branching flows

    J. Bang-Jensen, F. Havet, Anders Yeo

    2016Discrete Applied Mathematics10 citations Open access

    Semantic Scholar

    Save

44. Facial colorings using Hall's Theorem

    F. Havet, D. Král', Jean-Sébastien Sereni, R. Škrekovski

    2010European journal of combinatorics (Print)10 citations Open access

    Semantic Scholar

    Save

45. Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof

    N. Cohen, F. Havet

    2010Discrete Mathematics10 citations Open access

    Semantic Scholar

    Save

46. On the Minimum Number of Inversions to Make a Digraph k ‐(Arc‐)Strong

    Julien Duron, F. Havet, Florian Hörsch, Clément Rambaud

    2023Journal of Graph Theory9 citations Open access

    Semantic Scholar

    Save

47. Cooperative Colorings of Trees and of Bipartite Graphs

    R. Aharoni, Eli Berger, M. Chudnovsky, F. Havet +1 more

    2018Electronic Journal of Combinatorics9 citations Open access

    Semantic Scholar

    Save

48. Bipartite spanning sub(di)graphs induced by 2‐partitions

    J. Bang-Jensen, S. Bessy, F. Havet, Anders Yeo

    2017Journal of Graph Theory9 citations Open access

    Semantic Scholar

    Save

49. Minimum density of identifying codes of king grids

    Rennan Dantas, F. Havet, R. Sampaio

    2017Electron. Notes Discret. Math.9 citations Open access

    Semantic Scholar

    Save

50. Backbone colouring: Tree backbones with small diameter in planar graphs

    Victor A. Campos, F. Havet, R. Sampaio, Ana Silva

    2013Theoretical Computer Science9 citations Open access

    Semantic Scholar

    Save