Trees in tournaments. - Frédéric Havet (Electron. Notes Discret. Math., 2000)

Finding an Oriented Hamiltonian Path in a Tournament. - Frédéric Havet (J. Algorithms, 2000)

Oriented Hamiltonian Cycles in Tournaments. - Frédéric Havet (J. Comb. Theory B, 2000)

Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture. - Frédéric Havet; Stéphan Thomassé (J. Comb. Theory B, 2000)

Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture. - Frédéric Havet; Stéphan Thomassé (J. Graph Theory, 2000)

Channel assignment and multicolouring of the induced subgraphs of the triangular lattice. - Frédéric Havet (Discret. Math., 2001)

Trees with three leaves are (n + l)-unavoidable. - Stéphan Ceroi; Frédéric Havet (Electron. Notes Discret. Math., 2001)

Design of Fault Tolerant Satellite Networks with Priorities via Selectors. - Frédéric Havet (SIROCCO, 2002)

Finding a five bicolouring of a triangle-free subgraph of the triangular lattice. - Frédéric Havet; Janez Zerovnik (Discret. Math., 2002)

On Unavoidability of Trees with kLeaves. - Frédéric Havet (Graphs Comb., 2003)

Trees with three leaves are (n+1)-unavoidable. - Stéphan Ceroi; Frédéric Havet (Discret. Appl. Math., 2004)

Stable set meeting every longest path. - Frédéric Havet (Discret. Math., 2004)

Pancyclic arcs and connectivity in tournaments. - Frédéric Havet (J. Graph Theory, 2004)

The Push Tree problem. - Frédéric Havet; Marc Wennink (Networks, 2004)

Channel Assignment and Improper Choosability of Graphs. - Frédéric Havet; Jean-Sébastien Sereni (WG, 2005)

Improper Colourings of Unit Disk Graphs. - Frédéric Havet; Ross J. Kang; Jean-Sébastien Sereni (Electron. Notes Discret. Math., 2005)

3-facial colouring of plane graphs - Frédéric Havet; Jean-Sébastien Sereni; Riste Skrekovski (CoRR, 2006)

Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree. - Stéphane Bessy; Frédéric Havet; Etienne Birmelé (J. Graph Theory, 2006)

Improper choosability of graphs and maximum average degree. - Frédéric Havet; Jean-Sébastien Sereni (J. Graph Theory, 2006)

Repartitors, Selectors and Superselectors. - Frédéric Havet (J. Interconnect. Networks, 2006)

Fault tolerant on-board networks with priorities. - Jean-Claude Bermond; Frédéric Havet; Csaba D. Tóth (Networks, 2006)

List Colouring Squares of Planar Graphs. - Frédéric Havet; Jan van den Heuvel; Colin McDiarmid; Bruce A. Reed (Electron. Notes Discret. Math., 2007)

Paths with two blocks in n-chromatic digraphs. - Louigi Addario-Berry; Frédéric Havet; Stéphan Thomassé (J. Comb. Theory B, 2007)

L(2, 1)-labelling of graphs. - Frédéric Havet; Bruce A. Reed; Jean-Sébastien Sereni (SODA, 2008)

Hoàng-Reed conjecture holds for tournaments. - Frédéric Havet; Stéphan Thomassé; Anders Yeo (Discret. Math., 2008)

(p, 1)-Total labelling of graphs. - Frédéric Havet; Min-Li Yu (Discret. Math., 2008)

Bisimplicial vertices in even-hole-free graphs. - Louigi Addario-Berry; Maria Chudnovsky; Frédéric Havet; Bruce A. Reed; Paul D. Seymour (J. Comb. Theory B, 2008)

3-Facial Coloring of Plane Graphs. - Frédéric Havet; Jean-Sébastien Sereni; Riste Skrekovski (SIAM J. Discret. Math., 2008)

About a Brooks-type theorem for improper colouring. - Ricardo C. Corrêa; Frédéric Havet; Jean-Sébastien Sereni (Australas. J Comb., 2009)

Complexity of (p, 1)-total labelling. - Frédéric Havet; Stéphan Thomassé (Discret. Appl. Math., 2009)

Choosability of the square of planar subcubic graphs with large girth. - Frédéric Havet (Discret. Math., 2009)

Acyclic edge-colouring of planar graphs. Extended abstract. - Nathann Cohen; Frédéric Havet; Tobias Müller (Electron. Notes Discret. Math., 2009)

Circular choosability. - Frédéric Havet; Ross J. Kang; Tobias Müller 001; Jean-Sébastien Sereni (J. Graph Theory, 2009)

Improper coloring of unit disk graphs. - Frédéric Havet; Ross J. Kang; Jean-Sébastien Sereni (Networks, 2009)

On the Grundy Number of a Graph. - Frédéric Havet; Leonardo Sampaio Rocha (IPEC, 2010)

WDM and Directed Star Arboricity. - Omid Amini; Frédéric Havet; Florian Huc; Stéphan Thomassé (Comb. Probab. Comput., 2010)

k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4. - Nicole Eggemann; Frédéric Havet; Steven D. Noble (Discret. Appl. Math., 2010)

Grundy number and products of graphs. - Marie Asté; Frédéric Havet; Cláudia Linhares Sales (Discret. Math., 2010)

Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof. - Nathann Cohen; Frédéric Havet (Discret. Math., 2010)

Corrigendum to "(p, 1)-total labelling of graphs" [Discrete Mathematics 308 (2008) 496-513]. - Frédéric Havet; Min-Li Yu (Discret. Math., 2010)

Improper Coloring of Weighted Grid and Hexagonal Graphs. - Jean-Claude Bermond; Frédéric Havet; Florian Huc; Cláudia Linhares Sales (Discret. Math. Algorithms Appl., 2010)

Facial colorings using Hall's Theorem. - Frédéric Havet; Daniel Král'; Jean-Sébastien Sereni; Riste Skrekovski (Eur. J. Comb., 2010)

Exact Algorithms for L(2, 1)-Labeling of Graphs. - Frédéric Havet; Martin Klazar; Jan Kratochvíl; Dieter Kratsch; Mathieu Liedloff (Algorithmica, 2011)

Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree. - Nathann Cohen; Frédéric Havet (Graphs Comb., 2011)

Facial non-repetitive edge-coloring of plane graphs. - Frédéric Havet; Stanislav Jendrol'; Roman Soták; Erika Skrabul'áková (J. Graph Theory, 2011)

Acyclic Edge-Coloring of Planar Graphs. - Manu Basavaraju; L. Sunil Chandran; Nathann Cohen; Frédéric Havet; Tobias Müller (SIAM J. Discret. Math., 2011)

5-Coloring Graphs with 4 Crossings. - Rok Erman; Frédéric Havet; Bernard Lidický; Ondrej Pangrác (SIAM J. Discret. Math., 2011)

Good edge-labelling of graphs. - Júlio Araújo 001; Nathann Cohen; Frédéric Giroire; Frédéric Havet (Discret. Appl. Math., 2012)

On spanning galaxies in digraphs. - Daniel Gonçalves 001; Frédéric Havet; Alexandre Pinlou; Stéphan Thomassé (Discret. Appl. Math., 2012)

b-coloring of tight graphs. - Frédéric Havet; Cláudia Linhares Sales; Leonardo Sampaio Rocha (Discret. Appl. Math., 2012)

Weighted improper colouring. - Júlio Araújo 001; Jean-Claude Bermond; Frédéric Giroire; Frédéric Havet; Dorian Mazauric; Remigiusz Modrzejewski (J. Discrete Algorithms, 2012)

New Bounds on the Grundy Number of Products of Graphs. - Victor A. Campos; András Gyárfás; Frédéric Havet; Cláudia Linhares Sales; Frédéric Maffray (J. Graph Theory, 2012)

Griggs and Yeh's Conjecture and L(p, 1)-labelings. - Frédéric Havet; Bruce A. Reed; Jean-Sébastien Sereni (SIAM J. Discret. Math., 2012)

Finding an induced subdivision of a digraph. - Jørgen Bang-Jensen; Frédéric Havet; Nicolas Trotignon (Theor. Comput. Sci., 2012)

On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems. - Sylvain Guillemot; Frédéric Havet; Christophe Paul; Anthony Perez 001 (Algorithmica, 2013)

On the Grundy and b-Chromatic Numbers of a Graph. - Frédéric Havet; Leonardo Sampaio Rocha (Algorithmica, 2013)

Oriented trees in digraphs. - Louigi Addario-Berry; Frédéric Havet; Cláudia Linhares Sales; Bruce A. Reed; Stéphan Thomassé (Discret. Math., 2013)

Enumerating the edge-colourings and total colourings of a regular graph. - Stéphane Bessy; Frédéric Havet (J. Comb. Optim., 2013)

The game Grundy number of graphs. - Frédéric Havet; Xuding Zhu (J. Comb. Optim., 2013)

Backbone colouring: Tree backbones with small diameter in planar graphs. - Victor A. Campos; Frédéric Havet; Rudini Menezes Sampaio; Ana Silva 001 (Theor. Comput. Sci., 2013)

(Circular) backbone colouring: Forest backbones in planar graphs. - Frédéric Havet; Andrew D. King; Mathieu Liedloff; Ioan Todinca (Discret. Appl. Math., 2014)

List circular backbone colouring. - Frédéric Havet; Andrew D. King (Discret. Math. Theor. Comput. Sci., 2014)

Detection number of bipartite graphs and cubic graphs. - Frédéric Havet; Nagarajan Paramaguru; Rathinasamy Sampathkumar (Discret. Math. Theor. Comput. Sci., 2014)

Colouring graphs with constraints on connectivity. - Pierre Aboulker; Nick Brettell; Frédéric Havet; Dániel Marx; Nicolas Trotignon (CoRR, 2015)

Complexity of greedy edge-colouring. - Frédéric Havet; Ana Karolinna Maia; Min-Li Yu (J. Braz. Comput. Soc., 2015)

On the proper orientation number of bipartite graphs. - Júlio Araújo 001; Nathann Cohen; Susanna F. de Rezende; Frédéric Havet; Phablo F. S. Moura (Theor. Comput. Sci., 2015)

Finding a subdivision of a digraph. - Jørgen Bang-Jensen; Frédéric Havet; Ana Karolinna Maia (Theor. Comput. Sci., 2015)

Design of fault-tolerant on-board networks with variable switch sizes. - Olivier Delmas; Frédéric Havet; Mickaël Montassier; Stéphane Pérennes (Theor. Comput. Sci., 2015)

Minimum-Density Identifying Codes in Square Grids. - Marwane Bouznif; Frédéric Havet; Myriam Preissmann (AAIM, 2016)

The complexity of finding arc-disjoint branching flows. - Jørgen Bang-Jensen; Frédéric Havet; Anders Yeo (Discret. Appl. Math., 2016)

Compressing Two-dimensional Routing Tables with Order. - Frédéric Giroire; Frédéric Havet; Joanna Moulierac (Electron. Notes Discret. Math., 2016)

Proper orientation of cacti. - Júlio Araújo 001; Frédéric Havet; Cláudia Linhares Sales; Ana Silva 001 (Theor. Comput. Sci., 2016)

Finding good 2-partitions of digraphs II. Enumerable properties. - Jørgen Bang-Jensen; Nathann Cohen; Frédéric Havet (Theor. Comput. Sci., 2016)

Finding good 2-partitions of digraphs I. Hereditary properties. - Jørgen Bang-Jensen; Frédéric Havet (Theor. Comput. Sci., 2016)

Complexity Dichotomies for the Minimum ℱ -Overlay Problem. - Nathann Cohen; Frédéric Havet; Dorian Mazauric; Ignasi Sau; Rémi Watrigant (IWOCA, 2017)

Identifying codes for infinite triangular grids with a finite number of rows. - Rennan Dantas; Frédéric Havet; Rudini M. Sampaio (Discret. Math., 2017)

Bispindle in strongly connected digraphs with large chromatic number. - Nathann Cohen; Frédéric Havet; William Lochet; Raul Lopes 001 (Electron. Notes Discret. Math., 2017)

Minimum density of identifying codes of king grids. - Rennan Dantas; Rudini M. Sampaio; Frédéric Havet (Electron. Notes Discret. Math., 2017)

Coloring Graphs with Constraints on Connectivity. - Pierre Aboulker; Nick Brettell; Frédéric Havet; Dániel Marx; Nicolas Trotignon (J. Graph Theory, 2017)

Tournaments and Semicomplete Digraphs. - Jørgen Bang-Jensen; Frédéric Havet (Classes of Directed Graphs, 2018)

On the Complexity of Compressing Two Dimensional Routing Tables with Order. - Frédéric Giroire; Frédéric Havet; Joanna Moulierac (Algorithmica, 2018)

On the Minimum Size of an Identifying Code Over All Orientations of a Graph. - Nathann Cohen; Frédéric Havet (Electron. J. Comb., 2018)

Bispindles in Strongly Connected Digraphs with Large Chromatic Number. - Nathann Cohen; Frédéric Havet; William Lochet; Raul Lopes 001 (Electron. J. Comb., 2018)

Steinberg-like theorems for backbone colouring. - Júlio Araújo 001; Frédéric Havet; Mathieu Schmitt (Discret. Appl. Math., 2018)

Complexity dichotomies for the MinimumF-Overlay problem. - Nathann Cohen; Frédéric Havet; Dorian Mazauric; Ignasi Sau; Rémi Watrigant (J. Discrete Algorithms, 2018)

χ-bounded families of oriented graphs. - Pierre Aboulker; Jørgen Bang-Jensen; Nicolas Bousquet 001; Pierre Charbit; Frédéric Havet; Frédéric Maffray; José Zamora (J. Graph Theory, 2018)

Subdivisions of oriented cycles in digraphs with large chromatic number. - Nathann Cohen; Frédéric Havet; William Lochet; Nicolas Nisse (J. Graph Theory, 2018)

Finding a subdivision of a prescribed digraph of order 4. - Frédéric Havet; Ana Karolinna Maia; Bojan Mohar (J. Graph Theory, 2018)

Out-degree reducing partitions of digraphs. - Jørgen Bang-Jensen; Stéphane Bessy; Frédéric Havet; Anders Yeo (Theor. Comput. Sci., 2018)

Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number. - Pierre Aboulker; Nathann Cohen; Frédéric Havet; William Lochet; Phablo F. S. Moura; Stéphan Thomassé (Electron. J. Comb., 2019)

Backbone colouring and algorithms for TDMA scheduling. - Julien Bensmail; Thibaut Blanc; Nathann Cohen; Frédéric Havet; Leonardo S. Rocha 001 (Discret. Math. Theor. Comput. Sci., 2019)

Constrained ear decompositions in graphs and digraphs. - Frédéric Havet; Nicolas Nisse (Discret. Math. Theor. Comput. Sci., 2019)

On the Unavoidability of Oriented Trees. - François Dross; Frédéric Havet (LAGOS, 2019)

Bipartite spanning sub(di)graphs induced by 2-partitions. - Jørgen Bang-Jensen; Stéphane Bessy; Frédéric Havet; Anders Yeo (J. Graph Theory, 2019)

Inversion number of an oriented graph and related parameters. - Jørgen Bang-Jensen; Jonas Costa Ferreira da Silva; Frédéric Havet (ALGOS, 2020)

Cooperative Colorings of Trees and of Bipartite Graphs. - Ron Aharoni; Eli Berger; Maria Chudnovsky; Frédéric Havet; Zilin Jiang (Electron. J. Comb., 2020)

Corrigendum to "Bisimplicial vertices in even-hole-free graphs". - Louigi Addario-Berry; Maria Chudnovsky; Frédéric Havet; Bruce A. Reed; Paul D. Seymour (J. Comb. Theory B, 2020)

A variant of the Erdős-Sós conjecture. - Frédéric Havet; Bruce A. Reed; Maya Stein; David R. Wood (J. Graph Theory, 2020)

Powers of paths in tournaments. - Nemanja Draganic; François Dross; Jacob Fox; António Girão; Frédéric Havet; Dániel Korándi; William Lochet; David Munhá Correia; Alex D. Scott; Benny Sudakov (Comb. Probab. Comput., 2021)

On the semi-proper orientations of graphs. - Ali Dehghan 001; Frédéric Havet (Discret. Appl. Math., 2021)

On the inversion number of oriented graphs. - Jørgen Bang-Jensen; Jonas Costa Ferreira da Silva; Frédéric Havet (Discret. Math. Theor. Comput. Sci., 2021)

Grabbing Olives on Linear Pizzas and Pissaladières. - Jean-Claude Bermond; Frédéric Havet; Michel Cosnard (FUN, 2022)

On the Dichromatic Number of Surfaces. - Pierre Aboulker; Frédéric Havet; Kolja Knauer; Clément Rambaud (Electron. J. Comb., 2022)

On the minimum number of arcs in k-dicritical oriented graphs. - Pierre Aboulker; Thomas Bellitto; Frédéric Havet; Clément Rambaud (CoRR, 2022)

Problems, proofs, and disproofs on the inversion number. - Guillaume Aubian; Frédéric Havet; Florian Hörsch; Felix Klingelhöfer; Nicolas Nisse; Clément Rambaud; Quentin Vermande (CoRR, 2022)

On the Nash number and the diminishing Grundy number of a graph. - Frédéric Havet; Allen Ibiapina; Leonardo S. Rocha 001 (Discret. Appl. Math., 2022)

Overlaying a hypergraph with a graph with bounded maximum degree. - Frédéric Havet; Dorian Mazauric; Viet-Ha Nguyen 004; Rémi Watrigant (Discret. Appl. Math., 2022)

Arc-disjoint in- and out-branchings in digraphs of independence number at most 2. - Jørgen Bang-Jensen; Stéphane Bessy; Frédéric Havet; Anders Yeo (J. Graph Theory, 2022)

Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties. - Jørgen Bang-Jensen; Frédéric Havet; Matthias Kriesell; Anders Yeo (J. Graph Theory, 2022)

Semi-proper orientations of dense graphs. - J. Araujo; Frédéric Havet; Cláudia Linhares Sales; Nicolas Nisse; Karol Suchan (LAGOS, 2023)

On the minimum number of inversions to make a digraph k-(arc-)strong. - Julien Duron; Frédéric Havet; Florian Hörsch; Clément Rambaud (CoRR, 2023)

Spanning eulerian subdigraphs in semicomplete digraphs. - Jørgen Bang-Jensen; Frédéric Havet; Anders Yeo (J. Graph Theory, 2023)

On Finding the Best and Worst Orientations for the Metric Dimension. - Júlio Araújo 001; Julien Bensmail; Victor A. Campos; Frédéric Havet; Ana Karolinna Maia; Nicolas Nisse; Ana Silva 001 (Algorithmica, 2023)

Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order. - Pierre Aboulker; Frédéric Havet; François Pirot; Juliette Schabanel (CoRR, 2024)

Diameter of the inversion graph. - Frédéric Havet; Florian Hörsch; Clément Rambaud (CoRR, 2024)

On b-greedy colourings and z-colourings. - Jonas Costa Ferreira da Silva; Frédéric Havet (Discret. Appl. Math., 2024)

On the minimum number of arcs in 4-dicritical oriented graphs. - Frédéric Havet; Lucas Picasarri-Arrieta; Clément Rambaud (J. Graph Theory, 2024)

On the Minimum Number of Arcs in ( boldsymbol{k} )-Dicritical Oriented Graphs. - Pierre Aboulker; Thomas Bellitto; Frédéric Havet; Clément Rambaud (SIAM J. Discret. Math., 2024)

Digraph redicolouring. - Nicolas Bousquet 001; Frédéric Havet; Nicolas Nisse; Lucas Picasarri-Arrieta; Amadeus Reinald (Eur. J. Comb., 2024)

The 3-Dicritical Semi-Complete Digraphs. - Frédéric Havet; Florian Hörsch; Lucas Picasarri-Arrieta (Electron. J. Comb., 2025)

New lower bounds on the cutwidth of graphs. - Jean-Claude Bermond; Michel Cosnard; David Coudert; Frédéric Havet (Comput. Oper. Res., 2025)

Dichromatic number of chordal graphs. - Stéphane Bessy; Frédéric Havet; Lucas Picasarri-Arrieta (Graphs Comb., 2025)