Frédéric Havet

ORCID

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 69

Top Venues

Publications

Frédéric Havet, Florian Hörsch, Clément Rambaud
Diameter of the inversion graph. CoRR (2024)
Jonas Costa Ferreira da Silva, Frédéric Havet
On b-greedy colourings and z-colourings. Discret. Appl. Math. 359 (2024)
Pierre Aboulker, Frédéric Havet, François Pirot, Juliette Schabanel
Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order. CoRR (2024)
Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald
Digraph redicolouring. Eur. J. Comb. 116 (2024)
Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo
Spanning eulerian subdigraphs in semicomplete digraphs. J. Graph Theory 102 (3) (2023)
J. Araujo, Frédéric Havet, Cláudia Linhares Sales, Nicolas Nisse, Karol Suchan
Semi-proper orientations of dense graphs. LAGOS (2023)
Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud
On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs. WG (2023)
Júlio Araújo, Julien Bensmail, Victor A. Campos, Frédéric Havet, Ana Karolinna Maia, Nicolas Nisse, Ana Silva
On Finding the Best and Worst Orientations for the Metric Dimension. Algorithmica 85 (10) (2023)
Julien Duron, Frédéric Havet, Florian Hörsch, Clément Rambaud
On the minimum number of inversions to make a digraph k-(arc-)strong. CoRR (2023)
Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald
Digraph redicolouring. CoRR (2023)
Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud
On the minimum number of arcs in 4-dicritical oriented graphs. CoRR (2023)
Stéphane Bessy, Frédéric Havet, Lucas Picasarri-Arrieta
Dichromatic number of chordal graphs. CoRR (2023)
Pierre Aboulker, Frédéric Havet, Kolja Knauer, Clément Rambaud
On the Dichromatic Number of Surfaces. Electron. J. Comb. 29 (1) (2022)
Frédéric Havet, Dorian Mazauric, Viet-Ha Nguyen, Rémi Watrigant
Overlaying a hypergraph with a graph with bounded maximum degree. Discret. Appl. Math. 319 (2022)
Jean-Claude Bermond, Frédéric Havet, Michel Cosnard
Grabbing Olives on Linear Pizzas and Pissaladières. FUN (2022)
Jørgen Bang-Jensen, Frédéric Havet, Matthias Kriesell, Anders Yeo
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties. J. Graph Theory 99 (4) (2022)
Frédéric Havet, Allen Ibiapina, Leonardo S. Rocha
On the Nash number and the diminishing Grundy number of a graph. Discret. Appl. Math. 314 (2022)
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
Arc-disjoint in- and out-branchings in digraphs of independence number at most 2. J. Graph Theory 100 (2) (2022)
Pierre Aboulker, Thomas Bellitto, Frédéric Havet, Clément Rambaud
On the minimum number of arcs in k-dicritical oriented graphs. CoRR (2022)
Guillaume Aubian, Frédéric Havet, Florian Hörsch, Felix Klingelhöfer, Nicolas Nisse, Clément Rambaud, Quentin Vermande
Problems, proofs, and disproofs on the inversion number. CoRR (2022)
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
Powers of paths in tournaments. Comb. Probab. Comput. 30 (6) (2021)
Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet
On the inversion number of oriented graphs. Discret. Math. Theor. Comput. Sci. 23 (2) (2021)
Ali Dehghan, Frédéric Havet
On the semi-proper orientations of graphs. Discret. Appl. Math. 296 (2021)
François Dross, Frédéric Havet
On the unavoidability of oriented trees. J. Comb. Theory, Ser. B 151 (2021)
Pierre Aboulker, Frédéric Havet, Kolja Knauer, Clément Rambaud
On the dichromatic number of surfaces. CoRR (2021)
Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet
On the inversion number of oriented graphs. CoRR (2021)
Louigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce A. Reed, Paul D. Seymour
Corrigendum to "Bisimplicial vertices in even-hole-free graphs". J. Comb. Theory, Ser. B 142 (2020)
Ron Aharoni, Eli Berger, Maria Chudnovsky, Frédéric Havet, Zilin Jiang
Cooperative Colorings of Trees and of Bipartite Graphs. Electron. J. Comb. 27 (1) (2020)
Frédéric Havet, Bruce A. Reed, Maya Stein, David R. Wood
A variant of the Erdős-Sós conjecture. J. Graph Theory 94 (1) (2020)
Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet
Inversion number of an oriented graph and related parameters. ALGOS (2020)
Frédéric Havet, Dorian Mazauric, Viet-Ha Nguyen, Rémi Watrigant
Overlaying a Hypergraph with a Graph with Bounded Maximum Degree. CALDAM (2020)
Julien Bensmail, Thibaut Blanc, Nathann Cohen, Frédéric Havet, Leonardo S. Rocha
Backbone colouring and algorithms for TDMA scheduling. Discret. Math. Theor. Comput. Sci. 21 (3) (2019)
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
Bipartite spanning sub(di)graphs induced by 2-partitions. J. Graph Theory 92 (2) (2019)
Pierre Aboulker, Nathann Cohen, Frédéric Havet, William Lochet, Phablo F. S. Moura, Stéphan Thomassé
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number. Electron. J. Comb. 26 (3) (2019)
Frédéric Havet, Nicolas Nisse
Constrained ear decompositions in graphs and digraphs. Discret. Math. Theor. Comput. Sci. 21 (4) (2019)
François Dross, Frédéric Havet
On the Unavoidability of Oriented Trees. LAGOS (2019)
Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo
Spanning eulerian subdigraphs in semicomplete digraphs. CoRR (2019)
Nathann Cohen, Frédéric Havet, William Lochet, Nicolas Nisse
Subdivisions of oriented cycles in digraphs with large chromatic number. J. Graph Theory 89 (4) (2018)
Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes
Bispindles in Strongly Connected Digraphs with Large Chromatic Number. Electron. J. Comb. 25 (2) (2018)
Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant
Complexity dichotomies for the MinimumF-Overlay problem. J. Discrete Algorithms (2018)
Júlio Araújo, Frédéric Havet, Mathieu Schmitt
Steinberg-like theorems for backbone colouring. Discret. Appl. Math. 245 (2018)
François Dross, Frédéric Havet
On the unavoidability of oriented trees. CoRR (2018)
Frédéric Giroire, Frédéric Havet, Joanna Moulierac
On the Complexity of Compressing Two Dimensional Routing Tables with Order. Algorithmica 80 (1) (2018)
Rennan Dantas, Frédéric Havet, Rudini M. Sampaio
Minimum density of identifying codes of king grids. Discret. Math. 341 (10) (2018)
Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora
χ-bounded families of oriented graphs. J. Graph Theory 89 (3) (2018)
Nathann Cohen, Frédéric Havet
On the Minimum Size of an Identifying Code Over All Orientations of a Graph. Electron. J. Comb. 25 (1) (2018)
Frédéric Havet, Ana Karolinna Maia, Bojan Mohar
Finding a subdivision of a prescribed digraph of order 4. J. Graph Theory 87 (4) (2018)
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
Out-degree reducing partitions of digraphs. Theor. Comput. Sci. 719 (2018)
Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon
Coloring Graphs with Constraints on Connectivity. J. Graph Theory 85 (4) (2017)
Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes
Bispindle in strongly connected digraphs with large chromatic number. Electron. Notes Discret. Math. 62 (2017)
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
Out-degree reducing partitions of digraphs. CoRR (2017)
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
Bipartite spanning sub(di)graphs induced by 2-partitions. CoRR (2017)
Rennan Dantas, Frédéric Havet, Rudini M. Sampaio
Identifying codes for infinite triangular grids with a finite number of rows. Discret. Math. 340 (7) (2017)
Rennan Dantas, Rudini M. Sampaio, Frédéric Havet
Minimum density of identifying codes of king grids. Electron. Notes Discret. Math. 62 (2017)
Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant
Complexity Dichotomies for the Minimum F-Overlay Problem. CoRR (2017)
Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant
Complexity Dichotomies for the Minimum ℱ -Overlay Problem. IWOCA (2017)
Júlio Araújo, Frédéric Havet, Cláudia Linhares Sales, Ana Silva
Proper orientation of cacti. Theor. Comput. Sci. 639 (2016)
Jørgen Bang-Jensen, Nathann Cohen, Frédéric Havet
Finding good 2-partitions of digraphs II. Enumerable properties. Theor. Comput. Sci. 640 (2016)
Jørgen Bang-Jensen, Frédéric Havet
Finding good 2-partitions of digraphs I. Hereditary properties. Theor. Comput. Sci. 636 (2016)
Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo
The complexity of finding arc-disjoint branching flows. Discret. Appl. Math. 209 (2016)
Marwane Bouznif, Frédéric Havet, Myriam Preissmann
Minimum-Density Identifying Codes in Square Grids. AAIM (2016)
Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora
$χ$-bounded families of oriented graphs. CoRR (2016)
Frédéric Giroire, Frédéric Havet, Joanna Moulierac
Compressing Two-dimensional Routing Tables with Order. Electron. Notes Discret. Math. 52 (2016)
Olivier Delmas, Frédéric Havet, Mickaël Montassier, Stéphane Pérennes
Design of fault-tolerant on-board networks with variable switch sizes. Theor. Comput. Sci. 562 (2015)
Júlio Araújo, Frédéric Havet, Mathieu Schmitt
Steinberg-like theorems for backbone colouring. Electron. Notes Discret. Math. 50 (2015)
Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon
Colouring graphs with constraints on connectivity. CoRR (2015)
Júlio Araújo, Nathann Cohen, Susanna F. de Rezende, Frédéric Havet, Phablo F. S. Moura
On the proper orientation number of bipartite graphs. Theor. Comput. Sci. 566 (2015)
Frédéric Havet, Ana Karolinna Maia, Min-Li Yu
Complexity of greedy edge-colouring. J. Braz. Comput. Soc. 21 (1) (2015)
Jørgen Bang-Jensen, Frédéric Havet, Ana Karolinna Maia
Finding a subdivision of a digraph. Theor. Comput. Sci. 562 (2015)
Frédéric Havet, Andrew D. King, Mathieu Liedloff, Ioan Todinca
(Circular) backbone colouring: Forest backbones in planar graphs. Discret. Appl. Math. 169 (2014)
Frédéric Havet, Nagarajan Paramaguru, Rathinasamy Sampathkumar
Detection number of bipartite graphs and cubic graphs. Discret. Math. Theor. Comput. Sci. 16 (3) (2014)
Frédéric Havet, Andrew D. King
List circular backbone colouring. Discret. Math. Theor. Comput. Sci. 16 (1) (2014)
Sylvain Guillemot, Frédéric Havet, Christophe Paul, Anthony Perez
-Free Edge Modification Problems. Algorithmica 65 (4) (2013)
Stéphane Bessy, Frédéric Havet
Enumerating the edge-colourings and total colourings of a regular graph. J. Comb. Optim. 25 (4) (2013)
Frédéric Havet, Leonardo Sampaio Rocha
-Chromatic Numbers of a Graph. Algorithmica 65 (4) (2013)
Victor A. Campos, Frédéric Havet, Rudini Menezes Sampaio, Ana Silva
Backbone colouring: Tree backbones with small diameter in planar graphs. Theor. Comput. Sci. 487 (2013)
Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon
Finding an induced subdivision of a digraph. CoRR (2013)
Louigi Addario-Berry, Frédéric Havet, Cláudia Linhares Sales, Bruce A. Reed, Stéphan Thomassé
Oriented trees in digraphs. Discret. Math. 313 (8) (2013)
Frédéric Havet, Xuding Zhu
The game Grundy number of graphs. J. Comb. Optim. 25 (4) (2013)
Júlio Araújo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, Remigiusz Modrzejewski
Weighted improper colouring. J. Discrete Algorithms 16 (2012)
Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé
On spanning galaxies in digraphs. Discret. Appl. Math. 160 (6) (2012)
Júlio Araújo, Nathann Cohen, Frédéric Giroire, Frédéric Havet
Good edge-labelling of graphs. Discret. Appl. Math. 160 (18) (2012)
Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni
Griggs and Yeh's Conjecture and L(p, 1)-labelings. SIAM J. Discret. Math. 26 (1) (2012)
Frédéric Havet, Cláudia Linhares Sales, Leonardo Sampaio Rocha
b-coloring of tight graphs. Discret. Appl. Math. 160 (18) (2012)
Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon
Finding an induced subdivision of a digraph. Theor. Comput. Sci. 443 (2012)
Victor A. Campos, András Gyárfás, Frédéric Havet, Cláudia Linhares Sales, Frédéric Maffray
New Bounds on the Grundy Number of Products of Graphs. J. Graph Theory 71 (1) (2012)
Rok Erman, Frédéric Havet, Bernard Lidický, Ondrej Pangrác
5-Coloring Graphs with 4 Crossings. SIAM J. Discret. Math. 25 (1) (2011)
Manu Basavaraju, L. Sunil Chandran, Nathann Cohen, Frédéric Havet, Tobias Müller
Acyclic Edge-Coloring of Planar Graphs. SIAM J. Discret. Math. 25 (2) (2011)
Frédéric Havet, Stanislav Jendrol', Roman Soták, Erika Skrabul'áková
Facial non-repetitive edge-coloring of plane graphs. J. Graph Theory 66 (1) (2011)
Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon
Finding an induced subdivision of a digraph. Electron. Notes Discret. Math. 37 (2011)
Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
(2, 1)-Labeling of Graphs. Algorithmica 59 (2) (2011)
Nathann Cohen, Frédéric Havet
Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree. Graphs Comb. 27 (6) (2011)
Júlio Araújo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, Remigiusz Modrzejewski
Weighted Improper Colouring. IWOCA (2011)
Frédéric Havet, Min-Li Yu
Corrigendum to "(p, 1)-total labelling of graphs" [Discrete Mathematics 308 (2008) 496-513]. Discret. Math. 310 (15-16) (2010)
Nathann Cohen, Frédéric Havet
Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof. Discret. Math. 310 (21) (2010)
Frédéric Havet, Leonardo Sampaio Rocha
On the Grundy Number of a Graph. IPEC (2010)
Marie Asté, Frédéric Havet, Cláudia Linhares Sales
Grundy number and products of graphs. Discret. Math. 310 (9) (2010)
Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé
WDM and Directed Star Arboricity. Comb. Probab. Comput. 19 (2) (2010)
Frédéric Havet, Daniel Král', Jean-Sébastien Sereni, Riste Skrekovski
Facial colorings using Hall's Theorem. Eur. J. Comb. 31 (3) (2010)
Nicole Eggemann, Frédéric Havet, Steven D. Noble
k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4. Discret. Appl. Math. 158 (16) (2010)

Frédéric Havet.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Frédéric Havet