Frédéric Havet

1.6k total citations
96 papers, 746 citations indexed

About

Frédéric Havet is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, Frédéric Havet has authored 96 papers receiving a total of 746 indexed citations (citations by other indexed papers that have themselves been cited), including 85 papers in Computational Theory and Mathematics, 37 papers in Discrete Mathematics and Combinatorics and 31 papers in Electrical and Electronic Engineering. Recurrent topics in Frédéric Havet's work include Advanced Graph Theory Research (83 papers), Graph Labeling and Dimension Problems (51 papers) and Limits and Structures in Graph Theory (37 papers). Frédéric Havet is often cited by papers focused on Advanced Graph Theory Research (83 papers), Graph Labeling and Dimension Problems (51 papers) and Limits and Structures in Graph Theory (37 papers). Frédéric Havet collaborates with scholars based in France, Brazil and Austria. Frédéric Havet's co-authors include Jean‐Sébastien Sereni, Stéphan Thomassé, Bruce Reed, Nathann Cohen, Cláudia Linhares Sales, Min‐Li Yu, Jørgen Bang‐Jensen, Louigi Addario‐Berry, Jan van den Heuvel and Colin McDiarmid and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Networks.

In The Last Decade

Frédéric Havet

87 papers receiving 719 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Frédéric Havet France	16	675	282	209	98	67	96	746
Chı́nh T. Hoàng Canada	18	895 1.3×	389 1.4×	144 0.7×	148 1.5×	150 2.2×	78	957
Kristina Vušković United Kingdom	15	577 0.9×	246 0.9×	98 0.5×	96 1.0×	91 1.4×	48	632
Zsolt Tuza Hungary	13	313 0.5×	90 0.3×	68 0.3×	97 1.0×	77 1.1×	27	372
Rossella Petreschi Italy	11	264 0.4×	33 0.1×	106 0.5×	76 0.8×	53 0.8×	40	332
Ignasi Sau France	9	222 0.3×	65 0.2×	49 0.2×	87 0.9×	20 0.3×	77	294
Dorit Dor Israel	6	128 0.2×	66 0.2×	72 0.3×	45 0.5×	11 0.2×	10	250
Ana Sălăgean United Kingdom	9	174 0.3×	171 0.6×	308 1.5×	72 0.7×	17 0.3×	35	487
Sundar Vishwanathan India	10	186 0.3×	38 0.1×	43 0.2×	156 1.6×	16 0.2×	30	282
Janka Chlebı́ková Slovakia	8	241 0.4×	27 0.1×	52 0.2×	138 1.4×	7 0.1×	25	327
Norbert Blüm Germany	7	182 0.3×	20 0.1×	43 0.2×	98 1.0×	7 0.1×	22	301

Countries citing papers authored by Frédéric Havet

Since Specialization

Citations

This map shows the geographic impact of Frédéric Havet's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Frédéric Havet with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Frédéric Havet more than expected).

Fields of papers citing papers by Frédéric Havet

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Frédéric Havet. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Frédéric Havet. The network helps show where Frédéric Havet may publish in the future.

Co-authorship network of co-authors of Frédéric Havet

This figure shows the co-authorship network connecting the top 25 collaborators of Frédéric Havet. A scholar is included among the top collaborators of Frédéric Havet based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Frédéric Havet. Frédéric Havet is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Havet, Frédéric, et al.. (2025). Problems, Proofs, and Disproofs on the Inversion Number. The Electronic Journal of Combinatorics. 32(1).

Havet, Frédéric, et al.. (2024). On the Minimum Number of Arcs in \(\boldsymbol{k}\)-Dicritical Oriented Graphs. SIAM Journal on Discrete Mathematics. 38(2). 1863–1901.

Bousquet, Nicolás, et al.. (2023). Digraph redicolouring. European Journal of Combinatorics. 116. 103876–103876. 1 indexed citations

Bang‐Jensen, Jørgen, Frédéric Havet, Matthias Kriesell, & Anders Yeo. (2021). Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties. Journal of Graph Theory. 99(4). 615–636.

Bensmail, Julien, et al.. (2019). Backbone colouring and algorithms for TDMA scheduling. SHILAP Revista de lepidopterología.

Havet, Frédéric, et al.. (2017). Coloring Graphs with Constraints on Connectivity. HAL (Le Centre pour la Communication Scientifique Directe). 4 indexed citations

Havet, Frédéric, et al.. (2017). Steinberg-like theorems for backbone colouring. Discrete Applied Mathematics. 245. 155–167.

Giroire, Frédéric, Frédéric Havet, & Joanna Mouliérac. (2016). On the Complexity of Compressing Two Dimensional Routing Tables with Order. Algorithmica. 80(1). 209–233. 3 indexed citations

Bang‐Jensen, Jørgen & Frédéric Havet. (2016). Finding good 2-partitions of digraphs I. Hereditary properties. Theoretical Computer Science. 636. 85–94. 7 indexed citations

10.

Bang‐Jensen, Jørgen, Nathann Cohen, & Frédéric Havet. (2016). Finding good 2-partitions of digraphs II. Enumerable properties. Theoretical Computer Science. 640. 1–19. 8 indexed citations

11.

Cohen, Nathann, et al.. (2014). On the proper orientation number of bipartite graphs. Theoretical Computer Science. 566. 59–75. 8 indexed citations

12.

Bang‐Jensen, Jørgen, et al.. (2014). Finding a subdivision of a digraph. Theoretical Computer Science. 562. 283–303. 3 indexed citations

13.

Gonçalves, Daniel, Frédéric Havet, Alexandre Pinlou, & Stéphan Thomassé. (2011). On spanning galaxies in digraphs. Discrete Applied Mathematics. 160(6). 744–754. 2 indexed citations

14.

Havet, Frédéric, Daniel Král͏̌, Jean‐Sébastien Sereni, & Riste Škrekovski. (2009). Facial colorings using Hall’s Theorem. European Journal of Combinatorics. 31(3). 1001–1019. 7 indexed citations

15.

Havet, Frédéric, Bruce Reed, & Jean‐Sébastien Sereni. (2008). L(2,1)-labelling of graphs. HAL (Le Centre pour la Communication Scientifique Directe). 621–630. 16 indexed citations

16.

Havet, Frédéric, Stéphan Thomassé, & Anders Yeo. (2007). Hoàng–Reed conjecture holds for tournaments. Discrete Mathematics. 308(15). 3412–3415. 1 indexed citations

17.

Addario‐Berry, Louigi, Frédéric Havet, & Stéphan Thomassé. (2006). Paths with two blocks in n-chromatic digraphs. Journal of Combinatorial Theory Series B. 97(4). 620–626. 9 indexed citations

18.

Havet, Frédéric. (2004). Stable set meeting every longest path. Discrete Mathematics. 289(1-3). 169–173. 13 indexed citations

19.

Havet, Frédéric. (2001). Channel assignment and multicolouring of the induced subgraphs of the triangular lattice. Discrete Mathematics. 233(1-3). 219–231. 16 indexed citations

20.

Havet, Frédéric & Stéphan Thomassé. (2000). Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture. Journal of Combinatorial Theory Series B. 78(2). 243–273. 25 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact