Frédéric Havet

151 papers A* 1B 5C 5Misc 1Journal 136Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Colouring the interference digraph of a set of requests in a bidirected tree.
CoRR
Hugo Boulier, David Coudert, Frédéric Havet, François Pirot
2026 J jnl
On the Minimum Number of Inversions to Make a Digraph k -(Arc-)Strong.
J. Graph Theory
Julien Duron, Frédéric Havet, Florian Hörsch, Clément Rambaud
2025 J jnl
Dichromatic number of chordal graphs.
Graphs Comb.
Stéphane Bessy, Frédéric Havet, Lucas Picasarri-Arrieta
2025 J jnl
Making an oriented graph acyclic using inversions of bounded or prescribed size.
CoRR
Jørgen Bang-Jensen, Frédéric Havet, Florian Hörsch, Clément Rambaud, Amadeus Reinald, Caroline Silva
2025 J jnl
Minimum Acyclic Number and Maximum Dichromatic Number of Oriented Triangle-Free Graphs of a Given Order.
Electron. J. Comb.
Pierre Aboulker, Frédéric Havet, François Pirot, Juliette Schabanel
2025 J jnl
New lower bounds on the cutwidth of graphs.
Comput. Oper. Res.
Jean-Claude Bermond, Michel Cosnard, David Coudert, Frédéric Havet
2025 J jnl
Problems, Proofs, and Disproofs on the Inversion Number.
Electron. J. Comb.
Guillaume Aubian, Frédéric Havet, Florian Hörsch, Felix Kingelhoefer, Nicolas Nisse, Clément Rambaud, Quentin Vermande
2025 J jnl
The 3-Dicritical Semi-Complete Digraphs.
Electron. J. Comb.
Frédéric Havet, Florian Hörsch, Lucas Picasarri-Arrieta
2024 J jnl
Diameter of the inversion graph.
CoRR
Frédéric Havet, Florian Hörsch, Clément Rambaud
2024 J jnl
Digraph redicolouring.
Eur. J. Comb.
Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald
2024 J jnl
Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order.
CoRR
Pierre Aboulker, Frédéric Havet, François Pirot, Juliette Schabanel
2024 J jnl
On b-greedy colourings and z-colourings.
Discret. Appl. Math.
Jonas Costa Ferreira da Silva, Frédéric Havet
2024 J jnl
On the Minimum Number of Arcs in \(\boldsymbol{k}\)-Dicritical Oriented Graphs.
SIAM J. Discret. Math.
Pierre Aboulker, Thomas Bellitto, Frédéric Havet, Clément Rambaud
2024 J jnl
On the minimum number of arcs in 4-dicritical oriented graphs.
J. Graph Theory
Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud
2023 J jnl
Dichromatic number of chordal graphs.
CoRR
Stéphane Bessy, Frédéric Havet, Lucas Picasarri-Arrieta
2023 J jnl
Digraph redicolouring.
CoRR
Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald
2023 J jnl
On Finding the Best and Worst Orientations for the Metric Dimension.
Algorithmica
Júlio Araújo, Julien Bensmail, Victor A. Campos, Frédéric Havet, Ana Karolinna Maia, Nicolas Nisse, Ana Silva
2023 B conf
On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs.
WG
Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud
2023 J jnl
On the minimum number of arcs in 4-dicritical oriented graphs.
CoRR
Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud
2023 J jnl
On the minimum number of inversions to make a digraph k-(arc-)strong.
CoRR
Julien Duron, Frédéric Havet, Florian Hörsch, Clément Rambaud
2023 C conf
Semi-proper orientations of dense graphs.
LAGOS
Júlio Araújo, Frédéric Havet, Cláudia Linhares Sales, Nicolas Nisse, Karol Suchan
2023 J jnl
Spanning eulerian subdigraphs in semicomplete digraphs.
J. Graph Theory
Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo
2022 J jnl
Arc-disjoint in- and out-branchings in digraphs of independence number at most 2.
J. Graph Theory
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
2022 Misc conf
Grabbing Olives on Linear Pizzas and Pissaladières.
FUN
Jean-Claude Bermond, Frédéric Havet, Michel Cosnard
2022 J jnl
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties.
J. Graph Theory
Jørgen Bang-Jensen, Frédéric Havet, Matthias Kriesell, Anders Yeo
2022 J jnl
On the Dichromatic Number of Surfaces.
Electron. J. Comb.
Pierre Aboulker, Frédéric Havet, Kolja Knauer, Clément Rambaud
2022 J jnl
On the Nash number and the diminishing Grundy number of a graph.
Discret. Appl. Math.
Frédéric Havet, Allen Ibiapina, Leonardo S. Rocha
2022 J jnl
On the minimum number of arcs in k-dicritical oriented graphs.
CoRR
Pierre Aboulker, Thomas Bellitto, Frédéric Havet, Clément Rambaud
2022 J jnl
Overlaying a hypergraph with a graph with bounded maximum degree.
Discret. Appl. Math.
Frédéric Havet, Dorian Mazauric, Viet-Ha Nguyen, Rémi Watrigant
2022 J jnl
Problems, proofs, and disproofs on the inversion number.
CoRR
Guillaume Aubian, Frédéric Havet, Florian Hörsch, Felix Klingelhöfer, Nicolas Nisse, Clément Rambaud, Quentin Vermande
2021 J jnl
On the dichromatic number of surfaces.
CoRR
Pierre Aboulker, Frédéric Havet, Kolja Knauer, Clément Rambaud
2021 J jnl
On the inversion number of oriented graphs.
CoRR
Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet
2021 J jnl
On the inversion number of oriented graphs.
Discret. Math. Theor. Comput. Sci.
Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet
2021 J jnl
On the semi-proper orientations of graphs.
Discret. Appl. Math.
Ali Dehghan, Frédéric Havet
2021 J jnl
On the unavoidability of oriented trees.
J. Comb. Theory B
François Dross, Frédéric Havet
2021 J jnl
Powers of paths in tournaments.
Comb. Probab. Comput.
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
2020 J jnl
A variant of the Erdős-Sós conjecture.
J. Graph Theory
Frédéric Havet, Bruce A. Reed, Maya Stein, David R. Wood
2020 J jnl
Cooperative Colorings of Trees and of Bipartite Graphs.
Electron. J. Comb.
Ron Aharoni, Eli Berger, Maria Chudnovsky, Frédéric Havet, Zilin Jiang
2020 J jnl
Corrigendum to "Bisimplicial vertices in even-hole-free graphs".
J. Comb. Theory B
Louigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce A. Reed, Paul D. Seymour
2020 — conf
Inversion number of an oriented graph and related parameters.
ALGOS
Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet
2020 — conf
Overlaying a Hypergraph with a Graph with Bounded Maximum Degree.
CALDAM
Frédéric Havet, Dorian Mazauric, Viet-Ha Nguyen, Rémi Watrigant
2019 J jnl
Backbone colouring and algorithms for TDMA scheduling.
Discret. Math. Theor. Comput. Sci.
Julien Bensmail, Thibaut Blanc, Nathann Cohen, Frédéric Havet, Leonardo S. Rocha
2019 J jnl
Bipartite spanning sub(di)graphs induced by 2-partitions.
J. Graph Theory
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
2019 J jnl
Constrained ear decompositions in graphs and digraphs.
Discret. Math. Theor. Comput. Sci.
Frédéric Havet, Nicolas Nisse
2019 C conf
On the Unavoidability of Oriented Trees.
LAGOS
François Dross, Frédéric Havet
2019 J jnl
Spanning eulerian subdigraphs in semicomplete digraphs.
CoRR
Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo
2019 J jnl
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number.
Electron. J. Comb.
Pierre Aboulker, Nathann Cohen, Frédéric Havet, William Lochet, Phablo F. S. Moura, Stéphan Thomassé
2018 J jnl
Bispindles in Strongly Connected Digraphs with Large Chromatic Number.
Electron. J. Comb.
Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes
2018 J jnl
Complexity dichotomies for the MinimumF-Overlay problem.
J. Discrete Algorithms
Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant
2018 J jnl
Finding a subdivision of a prescribed digraph of order 4.
J. Graph Theory
Frédéric Havet, Ana Karolinna Maia, Bojan Mohar
2018 J jnl
Minimum density of identifying codes of king grids.
Discret. Math.
Rennan Dantas, Frédéric Havet, Rudini M. Sampaio
2018 J jnl
On the Complexity of Compressing Two Dimensional Routing Tables with Order.
Algorithmica
Frédéric Giroire, Frédéric Havet, Joanna Moulierac
2018 J jnl
On the Minimum Size of an Identifying Code Over All Orientations of a Graph.
Electron. J. Comb.
Nathann Cohen, Frédéric Havet
2018 J jnl
On the unavoidability of oriented trees.
CoRR
François Dross, Frédéric Havet
2018 J jnl
Out-degree reducing partitions of digraphs.
Theor. Comput. Sci.
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
2018 J jnl
Steinberg-like theorems for backbone colouring.
Discret. Appl. Math.
Júlio Araújo, Frédéric Havet, Mathieu Schmitt
2018 J jnl
Subdivisions of oriented cycles in digraphs with large chromatic number.
J. Graph Theory
Nathann Cohen, Frédéric Havet, William Lochet, Nicolas Nisse
2018 — ch.
Tournaments and Semicomplete Digraphs.
Classes of Directed Graphs
Jørgen Bang-Jensen, Frédéric Havet
2018 J jnl
χ-bounded families of oriented graphs.
J. Graph Theory
Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora
2017 J jnl
Bipartite spanning sub(di)graphs induced by 2-partitions.
CoRR
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
2017 J jnl
Bispindle in strongly connected digraphs with large chromatic number.
Electron. Notes Discret. Math.
Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes
2017 J jnl
Coloring Graphs with Constraints on Connectivity.
J. Graph Theory
Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon
2017 J jnl
Complexity Dichotomies for the Minimum F-Overlay Problem.
CoRR
Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant
2017 C conf
Complexity Dichotomies for the Minimum ℱ -Overlay Problem.
IWOCA
Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant
2017 J jnl
Identifying codes for infinite triangular grids with a finite number of rows.
Discret. Math.
Rennan Dantas, Frédéric Havet, Rudini M. Sampaio
2017 J jnl
Minimum density of identifying codes of king grids.
Electron. Notes Discret. Math.
Rennan Dantas, Rudini M. Sampaio, Frédéric Havet
2017 J jnl
Out-degree reducing partitions of digraphs.
CoRR
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
2016 J jnl
$χ$-bounded families of oriented graphs.
CoRR
Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora
2016 J jnl
Compressing Two-dimensional Routing Tables with Order.
Electron. Notes Discret. Math.
Frédéric Giroire, Frédéric Havet, Joanna Moulierac
2016 J jnl
Finding good 2-partitions of digraphs I. Hereditary properties.
Theor. Comput. Sci.
Jørgen Bang-Jensen, Frédéric Havet
2016 J jnl
Finding good 2-partitions of digraphs II. Enumerable properties.
Theor. Comput. Sci.
Jørgen Bang-Jensen, Nathann Cohen, Frédéric Havet
2016 C conf
Minimum-Density Identifying Codes in Square Grids.
AAIM
Marwane Bouznif, Frédéric Havet, Myriam Preissmann
2016 J jnl
Proper orientation of cacti.
Theor. Comput. Sci.
Júlio Araújo, Frédéric Havet, Cláudia Linhares Sales, Ana Silva
2016 J jnl
The complexity of finding arc-disjoint branching flows.
Discret. Appl. Math.
Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo
2015 J jnl
Colouring graphs with constraints on connectivity.
CoRR
Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon
2015 J jnl
Complexity of greedy edge-colouring.
J. Braz. Comput. Soc.
Frédéric Havet, Ana Karolinna Maia, Min-Li Yu
2015 J jnl
Design of fault-tolerant on-board networks with variable switch sizes.
Theor. Comput. Sci.
Olivier Delmas, Frédéric Havet, Mickaël Montassier, Stéphane Pérennes
2015 J jnl
Finding a subdivision of a digraph.
Theor. Comput. Sci.
Jørgen Bang-Jensen, Frédéric Havet, Ana Karolinna Maia
2015 J jnl
On the proper orientation number of bipartite graphs.
Theor. Comput. Sci.
Júlio Araújo, Nathann Cohen, Susanna F. de Rezende, Frédéric Havet, Phablo F. S. Moura
2015 J jnl
Steinberg-like theorems for backbone colouring.
Electron. Notes Discret. Math.
Júlio Araújo, Frédéric Havet, Mathieu Schmitt
2014 J jnl
(Circular) backbone colouring: Forest backbones in planar graphs.
Discret. Appl. Math.
Frédéric Havet, Andrew D. King, Mathieu Liedloff, Ioan Todinca
2014 J jnl
Detection number of bipartite graphs and cubic graphs.
Discret. Math. Theor. Comput. Sci.
Frédéric Havet, Nagarajan Paramaguru, Rathinasamy Sampathkumar
2014 J jnl
List circular backbone colouring.
Discret. Math. Theor. Comput. Sci.
Frédéric Havet, Andrew D. King
2013 J jnl
Backbone colouring: Tree backbones with small diameter in planar graphs.
Theor. Comput. Sci.
Victor A. Campos, Frédéric Havet, Rudini Menezes Sampaio, Ana Silva
2013 J jnl
Enumerating the edge-colourings and total colourings of a regular graph.
J. Comb. Optim.
Stéphane Bessy, Frédéric Havet
2013 J jnl
Finding an induced subdivision of a digraph.
CoRR
Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon
2013 J jnl
On the (Non-)Existence of Polynomial Kernels for
Algorithmica
Sylvain Guillemot, Frédéric Havet, Christophe Paul, Anthony Perez
2013 J jnl
On the Grundy and
Algorithmica
Frédéric Havet, Leonardo Sampaio Rocha
2013 J jnl
Oriented trees in digraphs.
Discret. Math.
Louigi Addario-Berry, Frédéric Havet, Cláudia Linhares Sales, Bruce A. Reed, Stéphan Thomassé
2013 J jnl
The game Grundy number of graphs.
J. Comb. Optim.
Frédéric Havet, Xuding Zhu
2012 J jnl
Finding an induced subdivision of a digraph.
Theor. Comput. Sci.
Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon
2012 J jnl
Good edge-labelling of graphs.
Discret. Appl. Math.
Júlio Araújo, Nathann Cohen, Frédéric Giroire, Frédéric Havet
2012 J jnl
Griggs and Yeh's Conjecture and L(p, 1)-labelings.
SIAM J. Discret. Math.
Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni
2012 J jnl
New Bounds on the Grundy Number of Products of Graphs.
J. Graph Theory
Victor A. Campos, András Gyárfás, Frédéric Havet, Cláudia Linhares Sales, Frédéric Maffray
2012 J jnl
On spanning galaxies in digraphs.
Discret. Appl. Math.
Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé
2012 J jnl
Weighted improper colouring.
J. Discrete Algorithms
Júlio Araújo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, Remigiusz Modrzejewski
2012 J jnl
b-coloring of tight graphs.
Discret. Appl. Math.
Frédéric Havet, Cláudia Linhares Sales, Leonardo Sampaio Rocha
2011 J jnl
5-Coloring Graphs with 4 Crossings.
SIAM J. Discret. Math.
Rok Erman, Frédéric Havet, Bernard Lidický, Ondrej Pangrác
2011 J jnl
Acyclic Edge-Coloring of Planar Graphs.
SIAM J. Discret. Math.
Manu Basavaraju, L. Sunil Chandran, Nathann Cohen, Frédéric Havet, Tobias Müller
2011 J jnl
Exact Algorithms for
Algorithmica
Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
2011 J jnl
Facial non-repetitive edge-coloring of plane graphs.
J. Graph Theory
Frédéric Havet, Stanislav Jendrol', Roman Soták, Erika Skrabul'áková
2011 J jnl
Finding an induced subdivision of a digraph.
Electron. Notes Discret. Math.
Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon
2011 J jnl
Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree.
Graphs Comb.
Nathann Cohen, Frédéric Havet
2011 C conf
Weighted Improper Colouring.
IWOCA
Júlio Araújo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, Remigiusz Modrzejewski
2010 J jnl
Corrigendum to "(p, 1)-total labelling of graphs" [Discrete Mathematics 308 (2008) 496-513].
Discret. Math.
Frédéric Havet, Min-Li Yu
2010 J jnl
Facial colorings using Hall's Theorem.
Eur. J. Comb.
Frédéric Havet, Daniel Král', Jean-Sébastien Sereni, Riste Skrekovski
2010 J jnl
Grundy number and products of graphs.
Discret. Math.
Marie Asté, Frédéric Havet, Cláudia Linhares Sales
2010 J jnl
Improper Coloring of Weighted Grid and Hexagonal Graphs.
Discret. Math. Algorithms Appl.
Jean-Claude Bermond, Frédéric Havet, Florian Huc, Cláudia Linhares Sales
2010 B conf
On the Grundy Number of a Graph.
IPEC
Frédéric Havet, Leonardo Sampaio Rocha
2010 J jnl
Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof.
Discret. Math.
Nathann Cohen, Frédéric Havet
2010 J jnl
WDM and Directed Star Arboricity.
Comb. Probab. Comput.
Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé
2010 J jnl
k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4.
Discret. Appl. Math.
Nicole Eggemann, Frédéric Havet, Steven D. Noble
2009 J jnl
About a Brooks-type theorem for improper colouring.
Australas. J Comb.
Ricardo C. Corrêa, Frédéric Havet, Jean-Sébastien Sereni
2009 J jnl
Acyclic edge-colouring of planar graphs. Extended abstract.
Electron. Notes Discret. Math.
Nathann Cohen, Frédéric Havet, Tobias Müller
2009 J jnl
Choosability of the square of planar subcubic graphs with large girth.
Discret. Math.
Frédéric Havet
2009 J jnl
Circular choosability.
J. Graph Theory
Frédéric Havet, Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni
2009 J jnl
Complexity of (p, 1)-total labelling.
Discret. Appl. Math.
Frédéric Havet, Stéphan Thomassé
2009 J jnl
Good edge-labelling of graphs.
Electron. Notes Discret. Math.
Júlio Araújo, Nathann Cohen, Frédéric Giroire, Frédéric Havet
2009 J jnl
Improper coloring of unit disk graphs.
Networks
Frédéric Havet, Ross J. Kang, Jean-Sébastien Sereni
2009 J jnl
Spanning galaxies in digraphs.
Electron. Notes Discret. Math.
Daniel Gonçalves, Alexandre Pinlou, Stéphan Thomassé, Frédéric Havet
2008 J jnl
(p, 1)-Total labelling of graphs.
Discret. Math.
Frédéric Havet, Min-Li Yu
2008 J jnl
3-Facial Coloring of Plane Graphs.
SIAM J. Discret. Math.
Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski
2008 J jnl
Bisimplicial vertices in even-hole-free graphs.
J. Comb. Theory B
Louigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce A. Reed, Paul D. Seymour
2008 J jnl
Hoàng-Reed conjecture holds for tournaments.
Discret. Math.
Frédéric Havet, Stéphan Thomassé, Anders Yeo
2008 A* conf
L(2, 1)-labelling of graphs.
SODA
Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni
2007 J jnl
List Colouring Squares of Planar Graphs.
Electron. Notes Discret. Math.
Frédéric Havet, Jan van den Heuvel, Colin McDiarmid, Bruce A. Reed
2007 J jnl
Paths with two blocks in n-chromatic digraphs.
J. Comb. Theory B
Louigi Addario-Berry, Frédéric Havet, Stéphan Thomassé
2007 J jnl
WDM and Directed Star Arboricity
CoRR
Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé
2006 J jnl
3-facial colouring of plane graphs
CoRR
Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski
2006 J jnl
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree.
J. Graph Theory
Stéphane Bessy, Frédéric Havet, Etienne Birmelé
2006 J jnl
Fault tolerant on-board networks with priorities.
Networks
Jean-Claude Bermond, Frédéric Havet, Csaba D. Tóth
2006 J jnl
Improper choosability of graphs and maximum average degree.
J. Graph Theory
Frédéric Havet, Jean-Sébastien Sereni
2006 J jnl
Repartitors, Selectors and Superselectors.
J. Interconnect. Networks
Frédéric Havet
2005 B conf
Channel Assignment and Improper Choosability of Graphs.
WG
Frédéric Havet, Jean-Sébastien Sereni
2005 J jnl
Improper Colourings of Unit Disk Graphs.
Electron. Notes Discret. Math.
Frédéric Havet, Ross J. Kang, Jean-Sébastien Sereni
2004 J jnl
Pancyclic arcs and connectivity in tournaments.
J. Graph Theory
Frédéric Havet
2004 J jnl
Stable set meeting every longest path.
Discret. Math.
Frédéric Havet
2004 J jnl
The Push Tree problem.
Networks
Frédéric Havet, Marc Wennink
2004 J jnl
Trees with three leaves are (n+1)-unavoidable.
Discret. Appl. Math.
Stéphan Ceroi, Frédéric Havet
2003 J jnl
On Unavoidability of Trees with kLeaves.
Graphs Comb.
Frédéric Havet
2002 B conf
Design of Fault Tolerant Satellite Networks with Priorities via Selectors.
SIROCCO
Frédéric Havet
2002 J jnl
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice.
Discret. Math.
Frédéric Havet, Janez Zerovnik
2002 J jnl
Trees in tournaments.
Discret. Math.
Frédéric Havet
2001 J jnl
Channel assignment and multicolouring of the induced subgraphs of the triangular lattice.
Discret. Math.
Frédéric Havet
2001 B conf
The push tree problem.
SPAA
Frédéric Havet, Marc Wennink
2001 J jnl
Trees with three leaves are (n + l)-unavoidable.
Electron. Notes Discret. Math.
Stéphan Ceroi, Frédéric Havet
2000 J jnl
Finding an Oriented Hamiltonian Path in a Tournament.
J. Algorithms
Frédéric Havet
2000 J jnl
Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture.
J. Graph Theory
Frédéric Havet, Stéphan Thomassé
2000 J jnl
Oriented Hamiltonian Cycles in Tournaments.
J. Comb. Theory B
Frédéric Havet
2000 J jnl
Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture.
J. Comb. Theory B
Frédéric Havet, Stéphan Thomassé
2000 J jnl
Trees in tournaments.
Electron. Notes Discret. Math.
Frédéric Havet