×

zbMATH — the first resource for mathematics

Havet, Frédéric

Compute Distance To:
Author ID: havet.frederic Recent zbMATH articles by "Havet, Frédéric"
Published as: Havet, F.; Havet, Frederic; Havet, Frédéric
Documents Indexed: 99 Publications since 2000
all top 5

Co-Authors

9 single-authored
16 Cohen, Nathann
10 Bang-Jensen, Jørgen
10 Sereni, Jean-Sébastien
10 Thomassé, Stéphan
8 Araújo, Júlio César Silva
7 Reed, Bruce Alan
6 Giroire, Frédéric
6 Linhares-Sales, Claudia
5 Mazauric, Dorian
4 Addario-Berry, Louigi
4 Bermond, Jean-Claude
4 Bessy, Stéphane
4 Lochet, William
4 Sampaio, Rudini Menezes
4 Yeo, Anders
3 Aboulker, Pierre
3 Chudnovsky, Maria
3 Dantas, Rennan
3 Kang, Ross J.
3 Müller, Tobias M.
3 Sampaio, Leonardo
3 Trotignon, Nicolas
3 Watrigant, Rémi
2 Campos, Victor A.
2 Ceroi, Stéphan
2 Gonçalves, Daniel
2 Huc, Florian
2 Karolinna Maia, A.
2 King, Andrew D.
2 Liedloff, Mathieu
2 Lopes, Raul H. C.
2 Maffray, Frédéric
2 Modrzejewski, Remigiusz
2 Moulierac, Joanna
2 Moura, Phablo F. S.
2 Nisse, Nicolas
2 Pinlou, Alexandre
2 Sau, Ignasi
2 Seymour, Paul D.
2 Škrekovski, Riste
2 Yu, Minli
1 Aharoni, Ron
1 Amini, Omid
1 Asté, Marie
1 Basavaraju, Manu
1 Bensmail, Julien
1 Berger, Eli
1 Birmele, Etienne
1 Blanc, Thibaut
1 Bousquet, Nicolas
1 Bouznif, Marwane
1 Brettell, Nick
1 Chandran, L. Sunil
1 Charbit, Pierre
1 Corrêa, Ricardo Cordeiro
1 de Rezende, Susanna F.
1 Delmas, Olivier
1 Eggemann, Nicole
1 Erman, Rok
1 Guillemot, Sylvain
1 Gyárfás, András
1 Jendrol’, Stanislav
1 Jiang, Zilin
1 Klazar, Martin
1 Král’, Daniel
1 Kratochvíl, Jan
1 Kratsch, Dieter
1 Lidický, Bernard
1 Marx, Dániel
1 McDiarmid, Colin J. H.
1 Mohar, Bojan
1 Montassier, Mickaël
1 Nguyen, Viet-Ha
1 Noble, Steven Derek
1 Pangrác, Ondřej
1 Paramaguru, Nagarajan
1 Paul, Christophe
1 Pérennes, Stéphane
1 Perez, Anthony
1 Preissmann, Myriam
1 Rocha, Leonardo
1 Sampathkumar, Rathinasamy
1 Schmitt, Michael
1 Schmitt, Moritz W.
1 Silva, Ana Carolina
1 Silva, Ana T. C.
1 Škrabul’áková, Erika Fecková
1 Soták, Roman
1 Stein, Maya Jakobine
1 Todinca, Ioan
1 Tóth, Csaba D.
1 van den Heuvel, Jan
1 Wennink, Marc
1 Wood, David Ronald
1 Zamora, José
1 Žerovnik, Janez
1 Zhu, Xuding

Publications by Year

Citations contained in zbMATH

79 Publications have been cited 553 times in 408 Documents Cited by Year
Improper choosability of graphs and maximum average degree. Zbl 1104.05026
Havet, Frédéric; Sereni, Jean-Sébastien
34
2006
\((p,1)\)-total labelling of graphs. Zbl 1137.05062
Havet, Frédéric; Yu, Min-Li
25
2008
List colouring squares of planar graphs. Zbl 1341.05073
Havet, Frédéric; van den Heuvel, Jan; McDiarmid, Colin; Reed, Bruce
25
2007
\(L(2,1)\)-labelling of graphs. Zbl 1192.05135
Havet, Frédéric; Reed, Bruce; Sereni, Jean-Sébastien
21
2008
Median orders of tournaments: A tool for the second neighborhood problem and Sumner’s conjecture. Zbl 0969.05029
Havet, Frédéric; Thomassé, Stéphan
20
2000
Acyclic edge-coloring of planar graphs. Zbl 1294.05070
Basavaraju, Manu; Chandran, L. Sunil; Cohen, Nathann; Havet, Frédéric; Müller, Tobias
19
2011
\(b\)-coloring of tight graphs. Zbl 1292.05111
Havet, Frédéric; Linhares Sales, Cláudia; Sampaio, Leonardo
18
2012
Bisimplicial vertices in even-hole-free graphs. Zbl 1205.05119
Addario-Berry, Louigi; Chudnovsky, Maria; Havet, Frédéric; Reed, Bruce; Seymour, Paul
18
2008
Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld’s conjecture. Zbl 1026.05053
Havet, Frédéric; Thomassé, Stéphan
17
2000
Exact algorithms for \(L(2,1)\)-labeling of graphs. Zbl 1213.68455
Havet, Frédéric; Klazar, Martin; Kratochvíl, Jan; Kratsch, Dieter; Liedloff, Mathieu
16
2011
On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems. Zbl 1262.68048
Guillemot, Sylvain; Havet, Frédéric; Paul, Christophe; Perez, Anthony
15
2013
Channel assignment and multicolouring of the induced subgraphs of the triangular lattice. Zbl 0983.05031
Havet, Frédéric
15
2001
Griggs and Yeh’s conjecture and \(L(p,1)\)-labelings. Zbl 1245.05110
Havet, Frédéric; Reed, Bruce; Sereni, Jean-Sébastien
14
2012
Choosability of the square of planar subcubic graphs with large girth. Zbl 1213.05084
Havet, F.
14
2009
Facial non-repetitive edge-coloring of plane graphs. Zbl 1222.05059
Havet, Frédéric; Jendrol’, Stanislav; Soták, Roman; Škrabul’áková, Erika
12
2011
On the Grundy and \(b\)-chromatic numbers of a graph. Zbl 1263.05030
Havet, Frédéric; Sampaio, Leonardo
11
2013
Improper coloring of unit disk graphs. Zbl 1207.05056
Havet, Frédéric; Kang, Ross J.; Sereni, Jean-Sébastien
10
2009
3-facial coloring of plane graphs. Zbl 1171.05019
Havet, Frédéric; Sereni, Jean-Sébastien; Škrekovski, Riste
10
2008
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice. Zbl 0997.05033
Havet, Frédéric; Žerovnik, Janez
10
2002
Weighted improper colouring. Zbl 1257.05035
Araujo, J.; Bermond, J-C.; Giroire, F.; Havet, F.; Mazauric, D.; Modrzejewski, R.
9
2012
Acyclic edge-colouring of planar graphs (extended abstract). Zbl 1273.05062
Cohen, Nathann; Havet, Frédéric; Müller, Tobias
9
2009
Oriented trees in digraphs. Zbl 1262.05066
Addario-Berry, Louigi; Havet, Frédéric; Sales, Cláudia Linhares; Reed, Bruce; Thomassé, Stéphan
8
2013
Facial colorings using Hall’s theorem. Zbl 1238.05090
Havet, Frédéric; Král’, Daniel; Sereni, Jean-Sébastien; škrekovski, Riste
8
2010
Finding good 2-partitions of digraphs. I. Hereditary properties. Zbl 1342.68150
Bang-Jensen, J.; Havet, Frédéric
7
2016
On unavoidability of trees with \(k\) leaves. Zbl 1022.05014
Havet, F.
7
2003
Minimum-density identifying codes in square grids. Zbl 06649748
Bouznif, Marwane; Havet, Frédéric; Preissmann, Myriam
6
2016
Finding good 2-partitions of digraphs. II. Enumerable properties. Zbl 1345.68168
Bang-Jensen, J.; Cohen, Nathann; Havet, Frédéric
6
2016
Backbone colouring: tree backbones with small diameter in planar graphs. Zbl 1300.05072
Campos, Victor; Havet, Frédéric; Sampaio, Rudini; Silva, Ana
6
2013
\(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\). Zbl 1209.05211
Eggemann, Nicole; Havet, Frédéric; Noble, Steven D.
6
2010
Grundy number and products of graphs. Zbl 1221.05126
Asté, Marie; Havet, Frédéric; Linhares-Sales, Claudia
6
2010
WDM and directed star arboricity. Zbl 1216.05044
Amini, Omid; Havet, Frédéric; Huc, Florian; Thomassé, Stéphan
6
2010
Trees in tournaments. Zbl 0995.05037
Havet, Frédéric
6
2002
Coloring graphs with constraints on connectivity. Zbl 1368.05040
Aboulker, Pierre; Brettell, Nick; Havet, Frédéric; Marx, Dániel; Trotignon, Nicolas
5
2017
On the proper orientation number of bipartite graphs. Zbl 1320.05035
Araujo, Julio; Cohen, Nathann; de Rezende, Susanna F.; Havet, Frédéric; Moura, Phablo F. S.
5
2015
(Circular) backbone colouring: forest backbones in planar graphs. Zbl 1288.05059
Havet, Frédéric; King, Andrew D.; Liedloff, Mathieu; Todinca, Ioan
5
2014
Enumerating the edge-colourings and total colourings of a regular graph. Zbl 1271.05050
Bessy, S.; Havet, F.
5
2013
The game Grundy number of graphs. Zbl 1272.91041
Havet, Frédéric; Zhu, Xuding
5
2013
On the Grundy number of a graph. Zbl 1253.68174
Havet, Frédéric; Sampaio, Leonardo
5
2010
Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable–a short proof. Zbl 1208.05016
Cohen, Nathann; Havet, Frédéric
5
2010
Improper colourings of unit disk graphs. Zbl 1182.05056
Havet, F.; Kang, R. J.; Sereni, J.-S.
5
2005
Stable set meeting every longest path. Zbl 1056.05072
Havet, F.
5
2004
Pancyclic arcs and connectivity in tournaments. Zbl 1060.05037
Havet, F.
5
2004
Oriented Hamiltonian cycles in tournaments. Zbl 1026.05052
Havet, Frédéric
5
2000
Tournaments and semicomplete digraphs. Zbl 1407.05102
Bang-Jensen, Jørgen; Havet, Frédéric
4
2018
Subdivisions of oriented cycles in digraphs with large chromatic number. Zbl 06997246
Cohen, Nathann; Havet, Frédéric; Lochet, William; Nisse, Nicolas
4
2018
Identifying codes for infinite triangular grids with a finite number of rows. Zbl 1361.05128
Dantas, Rennan; Havet, Frédéric; Sampaio, Rudini M.
4
2017
Proper orientation of cacti. Zbl 1345.05023
Araujo, Julio; Havet, Frédéric; Linhares Sales, Claudia; Silva, Ana
4
2016
Finding an induced subdivision of a digraph. Zbl 1243.68190
Bang-Jensen, Jørgen; Havet, Frédéric; Trotignon, Nicolas
4
2012
Complexity of (p,1)-total labelling. Zbl 1209.05212
Havet, Frédéric; Thomassé, Stéphan
4
2009
Paths with two blocks in \(n\)-chromatic digraphs. Zbl 1119.05049
Addario-Berry, L.; Havet, F.; Thomassé, S.
4
2007
Finding a subdivision of a digraph. Zbl 1303.68064
Bang-Jensen, Jørgen; Havet, Frédéric; Karolinna Maia, A.
3
2015
Detection number of bipartite graphs and cubic graphs. Zbl 1306.05129
Havet, Frédéric; Paramaguru, Nagarajan; Sampathkumar, Rathinasamy
3
2014
Good edge-labelling of graphs. Zbl 1305.05204
Araujo, J.; Cohen, N.; Giroire, F.; Havet, F.
3
2012
Improper coloring of weighted grid and hexagonal graphs. Zbl 1201.05034
Bermond, Jean-Claude; Havet, Frédéric; Huc, Florian; Sales, Cláudia Linhares
3
2010
Circular choosability. Zbl 1180.05044
Havet, Frédéric; Kang, Ross J.; Müller, Tobias; Sereni, Jean-Sébastien
3
2009
Hoàng-Reed conjecture holds for tournaments. Zbl 1147.05038
Havet, Frédéric; Thomassé, Stéphan; Yeo, Anders
3
2008
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree. Zbl 1116.05025
Bessy, S.; Havet, F.; Birmelé, E.
3
2006
The push tree problem. Zbl 1058.90012
Havet, Frédéric; Wennink, Marc
3
2004
Trees with three leaves are (\(n+1\))-unavoidable. Zbl 1043.05057
Ceroi, S.; Havet, F.
3
2004
Subdivisions in digraphs of large out-degree or large dichromatic number. Zbl 1417.05083
Aboulker, Pierre; Cohen, Nathann; Havet, Frédéric; Lochet, William; Moura, Phablo F. S.; Thomassé, Stéphan
2
2019
Minimum density of identifying codes of king grids. Zbl 1383.05184
Dantas, Rennan; Sampaio, Rudini M.; Havet, Frédéric
2
2017
New bounds on the Grundy number of products of graphs. Zbl 1248.05173
Campos, Victor; Gyárfás, András; Havet, Frédéric; Sales, Claudia Linhares; Maffray, Frédéric
2
2012
On spanning galaxies in digraphs. Zbl 1241.05043
Gonçalves, Daniel; Havet, Frédéric; Pinlou, Alexandre; Thomassé, Stéphan
2
2012
Finding an induced subdivision of a digraph. Zbl 1268.05191
Bang-Jensen, Jørgen; Havet, Frédéric; Trotignon, Nicolas
2
2011
Linear and 2-frugal choosability of graphs of small maximum average degree. Zbl 1234.05083
Cohen, Nathann; Havet, Frédéric
2
2011
Weighted improper colouring. Zbl 1314.05058
Araujo, Julio; Bermond, Jean-Claude; Giroire, Frédéric; Havet, Frédéric; Mazauric, Dorian; Modrzejewski, Remigiusz
2
2011
Good edge-labelling of graphs. Zbl 1268.05173
Araújo, Júlio; Cohen, Nathann; Giroire, Frédéric; Havet, Frédéric
2
2009
Fault tolerant on-board networks with priorities. Zbl 1090.90013
Bermond, J.-C.; Havet, F.; Tóth, C. D.
2
2006
A variant of the Erdős-Sós conjecture. Zbl 07202780
Havet, Frédéric; Reed, Bruce; Stein, Maya; Wood, David R.
1
2020
Finding a subdivision of a prescribed digraph of order 4. Zbl 1386.05075
Havet, Frédéric; Maia, A. Karolinna; Mohar, Bojan
1
2018
On the complexity of compressing two dimensional routing tables with order. Zbl 1386.68070
Giroire, Frédéric; Havet, Frédéric; Moulierac, Joanna
1
2018
Compressing two-dimensional routing tables with order. Zbl 1351.90066
Giroire, Frédéric; Havet, Frédéric; Moulierac, Joanna
1
2016
Steinberg-like theorems for backbone colouring. Zbl 1347.05056
Araujo, J.; Havet, F.; Schmitt, M.
1
2015
Design of fault-tolerant on-board networks with variable switch sizes. Zbl 1306.90027
Delmas, O.; Havet, F.; Montassier, M.; Pérennes, S.
1
2015
List circular backbone colouring. Zbl 1288.05088
Havet, Frederic; King, Andrew
1
2014
5-coloring graphs with 4 crossings. Zbl 1232.05078
Erman, Rok; Havet, Frédéric; Lidický, Bernard; Pangrác, Ondřej
1
2011
About a Brooks-type theorem for improper colouring. Zbl 1155.05022
Corrêa, Ricardo; Havet, Frédéric; Sereni, Jean-Sébastien
1
2009
Channel assignment and improper choosability of graphs. Zbl 1171.05333
Havet, Frédéric; Sereni, Jean-Sébastien
1
2005
Finding an oriented Hamiltonian path in a tournament. Zbl 0958.68193
Havet, Frédéric
1
2000
A variant of the Erdős-Sós conjecture. Zbl 07202780
Havet, Frédéric; Reed, Bruce; Stein, Maya; Wood, David R.
1
2020
Subdivisions in digraphs of large out-degree or large dichromatic number. Zbl 1417.05083
Aboulker, Pierre; Cohen, Nathann; Havet, Frédéric; Lochet, William; Moura, Phablo F. S.; Thomassé, Stéphan
2
2019
Tournaments and semicomplete digraphs. Zbl 1407.05102
Bang-Jensen, Jørgen; Havet, Frédéric
4
2018
Subdivisions of oriented cycles in digraphs with large chromatic number. Zbl 06997246
Cohen, Nathann; Havet, Frédéric; Lochet, William; Nisse, Nicolas
4
2018
Finding a subdivision of a prescribed digraph of order 4. Zbl 1386.05075
Havet, Frédéric; Maia, A. Karolinna; Mohar, Bojan
1
2018
On the complexity of compressing two dimensional routing tables with order. Zbl 1386.68070
Giroire, Frédéric; Havet, Frédéric; Moulierac, Joanna
1
2018
Coloring graphs with constraints on connectivity. Zbl 1368.05040
Aboulker, Pierre; Brettell, Nick; Havet, Frédéric; Marx, Dániel; Trotignon, Nicolas
5
2017
Identifying codes for infinite triangular grids with a finite number of rows. Zbl 1361.05128
Dantas, Rennan; Havet, Frédéric; Sampaio, Rudini M.
4
2017
Minimum density of identifying codes of king grids. Zbl 1383.05184
Dantas, Rennan; Sampaio, Rudini M.; Havet, Frédéric
2
2017
Finding good 2-partitions of digraphs. I. Hereditary properties. Zbl 1342.68150
Bang-Jensen, J.; Havet, Frédéric
7
2016
Minimum-density identifying codes in square grids. Zbl 06649748
Bouznif, Marwane; Havet, Frédéric; Preissmann, Myriam
6
2016
Finding good 2-partitions of digraphs. II. Enumerable properties. Zbl 1345.68168
Bang-Jensen, J.; Cohen, Nathann; Havet, Frédéric
6
2016
Proper orientation of cacti. Zbl 1345.05023
Araujo, Julio; Havet, Frédéric; Linhares Sales, Claudia; Silva, Ana
4
2016
Compressing two-dimensional routing tables with order. Zbl 1351.90066
Giroire, Frédéric; Havet, Frédéric; Moulierac, Joanna
1
2016
On the proper orientation number of bipartite graphs. Zbl 1320.05035
Araujo, Julio; Cohen, Nathann; de Rezende, Susanna F.; Havet, Frédéric; Moura, Phablo F. S.
5
2015
Finding a subdivision of a digraph. Zbl 1303.68064
Bang-Jensen, Jørgen; Havet, Frédéric; Karolinna Maia, A.
3
2015
Steinberg-like theorems for backbone colouring. Zbl 1347.05056
Araujo, J.; Havet, F.; Schmitt, M.
1
2015
Design of fault-tolerant on-board networks with variable switch sizes. Zbl 1306.90027
Delmas, O.; Havet, F.; Montassier, M.; Pérennes, S.
1
2015
(Circular) backbone colouring: forest backbones in planar graphs. Zbl 1288.05059
Havet, Frédéric; King, Andrew D.; Liedloff, Mathieu; Todinca, Ioan
5
2014
Detection number of bipartite graphs and cubic graphs. Zbl 1306.05129
Havet, Frédéric; Paramaguru, Nagarajan; Sampathkumar, Rathinasamy
3
2014
List circular backbone colouring. Zbl 1288.05088
Havet, Frederic; King, Andrew
1
2014
On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems. Zbl 1262.68048
Guillemot, Sylvain; Havet, Frédéric; Paul, Christophe; Perez, Anthony
15
2013
On the Grundy and \(b\)-chromatic numbers of a graph. Zbl 1263.05030
Havet, Frédéric; Sampaio, Leonardo
11
2013
Oriented trees in digraphs. Zbl 1262.05066
Addario-Berry, Louigi; Havet, Frédéric; Sales, Cláudia Linhares; Reed, Bruce; Thomassé, Stéphan
8
2013
Backbone colouring: tree backbones with small diameter in planar graphs. Zbl 1300.05072
Campos, Victor; Havet, Frédéric; Sampaio, Rudini; Silva, Ana
6
2013
Enumerating the edge-colourings and total colourings of a regular graph. Zbl 1271.05050
Bessy, S.; Havet, F.
5
2013
The game Grundy number of graphs. Zbl 1272.91041
Havet, Frédéric; Zhu, Xuding
5
2013
\(b\)-coloring of tight graphs. Zbl 1292.05111
Havet, Frédéric; Linhares Sales, Cláudia; Sampaio, Leonardo
18
2012
Griggs and Yeh’s conjecture and \(L(p,1)\)-labelings. Zbl 1245.05110
Havet, Frédéric; Reed, Bruce; Sereni, Jean-Sébastien
14
2012
Weighted improper colouring. Zbl 1257.05035
Araujo, J.; Bermond, J-C.; Giroire, F.; Havet, F.; Mazauric, D.; Modrzejewski, R.
9
2012
Finding an induced subdivision of a digraph. Zbl 1243.68190
Bang-Jensen, Jørgen; Havet, Frédéric; Trotignon, Nicolas
4
2012
Good edge-labelling of graphs. Zbl 1305.05204
Araujo, J.; Cohen, N.; Giroire, F.; Havet, F.
3
2012
New bounds on the Grundy number of products of graphs. Zbl 1248.05173
Campos, Victor; Gyárfás, András; Havet, Frédéric; Sales, Claudia Linhares; Maffray, Frédéric
2
2012
On spanning galaxies in digraphs. Zbl 1241.05043
Gonçalves, Daniel; Havet, Frédéric; Pinlou, Alexandre; Thomassé, Stéphan
2
2012
Acyclic edge-coloring of planar graphs. Zbl 1294.05070
Basavaraju, Manu; Chandran, L. Sunil; Cohen, Nathann; Havet, Frédéric; Müller, Tobias
19
2011
Exact algorithms for \(L(2,1)\)-labeling of graphs. Zbl 1213.68455
Havet, Frédéric; Klazar, Martin; Kratochvíl, Jan; Kratsch, Dieter; Liedloff, Mathieu
16
2011
Facial non-repetitive edge-coloring of plane graphs. Zbl 1222.05059
Havet, Frédéric; Jendrol’, Stanislav; Soták, Roman; Škrabul’áková, Erika
12
2011
Finding an induced subdivision of a digraph. Zbl 1268.05191
Bang-Jensen, Jørgen; Havet, Frédéric; Trotignon, Nicolas
2
2011
Linear and 2-frugal choosability of graphs of small maximum average degree. Zbl 1234.05083
Cohen, Nathann; Havet, Frédéric
2
2011
Weighted improper colouring. Zbl 1314.05058
Araujo, Julio; Bermond, Jean-Claude; Giroire, Frédéric; Havet, Frédéric; Mazauric, Dorian; Modrzejewski, Remigiusz
2
2011
5-coloring graphs with 4 crossings. Zbl 1232.05078
Erman, Rok; Havet, Frédéric; Lidický, Bernard; Pangrác, Ondřej
1
2011
Facial colorings using Hall’s theorem. Zbl 1238.05090
Havet, Frédéric; Král’, Daniel; Sereni, Jean-Sébastien; škrekovski, Riste
8
2010
\(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\). Zbl 1209.05211
Eggemann, Nicole; Havet, Frédéric; Noble, Steven D.
6
2010
Grundy number and products of graphs. Zbl 1221.05126
Asté, Marie; Havet, Frédéric; Linhares-Sales, Claudia
6
2010
WDM and directed star arboricity. Zbl 1216.05044
Amini, Omid; Havet, Frédéric; Huc, Florian; Thomassé, Stéphan
6
2010
On the Grundy number of a graph. Zbl 1253.68174
Havet, Frédéric; Sampaio, Leonardo
5
2010
Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable–a short proof. Zbl 1208.05016
Cohen, Nathann; Havet, Frédéric
5
2010
Improper coloring of weighted grid and hexagonal graphs. Zbl 1201.05034
Bermond, Jean-Claude; Havet, Frédéric; Huc, Florian; Sales, Cláudia Linhares
3
2010
Choosability of the square of planar subcubic graphs with large girth. Zbl 1213.05084
Havet, F.
14
2009
Improper coloring of unit disk graphs. Zbl 1207.05056
Havet, Frédéric; Kang, Ross J.; Sereni, Jean-Sébastien
10
2009
Acyclic edge-colouring of planar graphs (extended abstract). Zbl 1273.05062
Cohen, Nathann; Havet, Frédéric; Müller, Tobias
9
2009
Complexity of (p,1)-total labelling. Zbl 1209.05212
Havet, Frédéric; Thomassé, Stéphan
4
2009
Circular choosability. Zbl 1180.05044
Havet, Frédéric; Kang, Ross J.; Müller, Tobias; Sereni, Jean-Sébastien
3
2009
Good edge-labelling of graphs. Zbl 1268.05173
Araújo, Júlio; Cohen, Nathann; Giroire, Frédéric; Havet, Frédéric
2
2009
About a Brooks-type theorem for improper colouring. Zbl 1155.05022
Corrêa, Ricardo; Havet, Frédéric; Sereni, Jean-Sébastien
1
2009
\((p,1)\)-total labelling of graphs. Zbl 1137.05062
Havet, Frédéric; Yu, Min-Li
25
2008
\(L(2,1)\)-labelling of graphs. Zbl 1192.05135
Havet, Frédéric; Reed, Bruce; Sereni, Jean-Sébastien
21
2008
Bisimplicial vertices in even-hole-free graphs. Zbl 1205.05119
Addario-Berry, Louigi; Chudnovsky, Maria; Havet, Frédéric; Reed, Bruce; Seymour, Paul
18
2008
3-facial coloring of plane graphs. Zbl 1171.05019
Havet, Frédéric; Sereni, Jean-Sébastien; Škrekovski, Riste
10
2008
Hoàng-Reed conjecture holds for tournaments. Zbl 1147.05038
Havet, Frédéric; Thomassé, Stéphan; Yeo, Anders
3
2008
List colouring squares of planar graphs. Zbl 1341.05073
Havet, Frédéric; van den Heuvel, Jan; McDiarmid, Colin; Reed, Bruce
25
2007
Paths with two blocks in \(n\)-chromatic digraphs. Zbl 1119.05049
Addario-Berry, L.; Havet, F.; Thomassé, S.
4
2007
Improper choosability of graphs and maximum average degree. Zbl 1104.05026
Havet, Frédéric; Sereni, Jean-Sébastien
34
2006
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree. Zbl 1116.05025
Bessy, S.; Havet, F.; Birmelé, E.
3
2006
Fault tolerant on-board networks with priorities. Zbl 1090.90013
Bermond, J.-C.; Havet, F.; Tóth, C. D.
2
2006
Improper colourings of unit disk graphs. Zbl 1182.05056
Havet, F.; Kang, R. J.; Sereni, J.-S.
5
2005
Channel assignment and improper choosability of graphs. Zbl 1171.05333
Havet, Frédéric; Sereni, Jean-Sébastien
1
2005
Stable set meeting every longest path. Zbl 1056.05072
Havet, F.
5
2004
Pancyclic arcs and connectivity in tournaments. Zbl 1060.05037
Havet, F.
5
2004
The push tree problem. Zbl 1058.90012
Havet, Frédéric; Wennink, Marc
3
2004
Trees with three leaves are (\(n+1\))-unavoidable. Zbl 1043.05057
Ceroi, S.; Havet, F.
3
2004
On unavoidability of trees with \(k\) leaves. Zbl 1022.05014
Havet, F.
7
2003
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice. Zbl 0997.05033
Havet, Frédéric; Žerovnik, Janez
10
2002
Trees in tournaments. Zbl 0995.05037
Havet, Frédéric
6
2002
Channel assignment and multicolouring of the induced subgraphs of the triangular lattice. Zbl 0983.05031
Havet, Frédéric
15
2001
Median orders of tournaments: A tool for the second neighborhood problem and Sumner’s conjecture. Zbl 0969.05029
Havet, Frédéric; Thomassé, Stéphan
20
2000
Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld’s conjecture. Zbl 1026.05053
Havet, Frédéric; Thomassé, Stéphan
17
2000
Oriented Hamiltonian cycles in tournaments. Zbl 1026.05052
Havet, Frédéric
5
2000
Finding an oriented Hamiltonian path in a tournament. Zbl 0958.68193
Havet, Frédéric
1
2000
all top 5

Cited by 636 Authors

38 Havet, Frédéric
15 Bang-Jensen, Jørgen
15 Wang, Wei-Fan
12 Linhares-Sales, Claudia
11 Shu, Qiaojun
10 Raspaud, André
9 Borodin, Oleg Veniaminovich
9 Montassier, Mickaël
9 Rzążewski, Paweł
9 Wang, Yiqiao
8 Araújo, Júlio César Silva
8 Zhang, Xin
7 Cohen, Nathann
7 Jendrol’, Stanislav
7 Junosza-Szaniawski, Konstanty
7 Kostochka, Aleksandr Vasil’evich
7 Šparl, Petra
7 Žerovnik, Janez
6 Ivanova, Anna Olegovna
6 Král’, Daniel
6 Liedloff, Mathieu
6 Pilipczuk, Michał
6 Sakai Troxell, Denise
6 Sampaio, Rudini Menezes
6 Sereni, Jean-Sébastien
6 Soták, Roman
5 Campos, Victor A.
5 Choi, Ilkyoo
5 El Sahili, Amine
5 Giroire, Frédéric
5 Hasunuma, Toru
5 Ishii, Toshimasa
5 Kang, Ross J.
5 Karst, Nathaniel J.
5 Kratochvíl, Jan
5 Liu, Guizhen
5 Ono, Hirotaka
5 Sampaio, Leonardo
5 Thomassé, Stéphan
5 Uno, Yushi
5 Wang, Huijuan
4 Borowiecki, Piotr
4 Chen, Dong
4 Chen, Min
4 Czap, Július
4 Lin, Wensong
4 Liu, Bin
4 Lužar, Borut
4 Miao, Lianying
4 Oehrlein, Jessica
4 Pinlou, Alexandre
4 Przybyło, Jakub
4 Sau, Ignasi
4 Schreyer, Jens
4 Silva, Ana L.
4 Škrabul’áková, Erika Fecková
4 Škrekovski, Riste
4 Togni, Olivier
4 Vušković, Kristina
4 Wu, Jian-Liang
4 Yeo, Anders
4 Zhu, Haiyang
4 Zhu, Junjie
4 Zhu, Xuding
3 Bermond, Jean-Claude
3 Bonamy, Marthe
3 Chia, Ma-Lian
3 Cranston, Daniel W.
3 Cygan, Marek
3 Dantas, Rennan
3 de la Hoz, Enrique
3 Drange, Pål Grønås
3 Gastineau, Nicolas
3 Gimenez-Guzman, Jose Manuel
3 Janczewski, Robert
3 Komusiewicz, Christian
3 Kratsch, Dieter
3 Kühn, Daniela
3 Kuo, David Li-Wei
3 Lê Văn Băng
3 Ljubić, Ivana
3 Lochet, William
3 Lu, Xinzhong
3 Mandal, Nibedita
3 Marsa-Maestre, Ivan
3 Orden, David
3 Osthus, Deryk
3 Panda, Bhawani Sankar
3 Panigrahi, Pratima
3 Paulusma, Daniël
3 Pérennes, Stéphane
3 Peterin, Iztok
3 Silva, Ana Carolina
3 Silva, Ana Maria F.
3 Silva, Ana T. C.
3 van den Heuvel, Jan
3 Wrochna, Marcin
3 Wu, Lidong
3 Yu, Gexin
3 Yuster, Raphael
...and 536 more Authors
all top 5

Cited in 54 Serials

63 Discrete Applied Mathematics
60 Discrete Mathematics
28 Journal of Combinatorial Optimization
27 Journal of Graph Theory
19 Theoretical Computer Science
18 Information Processing Letters
18 Graphs and Combinatorics
16 Algorithmica
15 European Journal of Combinatorics
12 Journal of Combinatorial Theory. Series B
10 The Electronic Journal of Combinatorics
8 SIAM Journal on Discrete Mathematics
5 Discussiones Mathematicae. Graph Theory
4 Applied Mathematics and Computation
4 Acta Mathematica Sinica. English Series
4 Discrete Optimization
4 Discrete Mathematics, Algorithms and Applications
3 International Journal of Computer Mathematics
3 Combinatorics, Probability and Computing
3 Theory of Computing Systems
3 Bulletin of the Malaysian Mathematical Sciences Society. Second Series
3 Journal of Discrete Algorithms
2 Journal of Computer and System Sciences
2 Networks
2 Combinatorica
2 Computational Geometry
2 Journal of Global Optimization
2 European Journal of Operational Research
2 Comptes Rendus. Mathématique. Académie des Sciences, Paris
2 Journal of Applied Mathematics and Computing
2 Central European Journal of Mathematics
2 Optimization Letters
1 Acta Mathematica Vietnamica
1 Journal of Economic Theory
1 SIAM Journal on Computing
1 Siberian Mathematical Journal
1 Cybernetics and Systems
1 Computers & Operations Research
1 Foundations of Computing and Decision Sciences
1 Opuscula Mathematica
1 RAIRO. Operations Research
1 AKCE International Journal of Graphs and Combinatorics
1 Sibirskie Èlektronnye Matematicheskie Izvestiya
1 Mathematics in Computer Science
1 Involve
1 Science China. Mathematics
1 Symmetry
1 Forum of Mathematics, Sigma
1 Computer Science Review
1 ACM Transactions on Computation Theory
1 European Journal of Mathematics
1 Open Mathematics
1 Communications in Combinatorics and Optimization
1 The Art of Discrete and Applied Mathematics

Citations by Year