Éric Sopena

1.6k total citations
58 papers, 882 citations indexed

About

Éric Sopena is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, Éric Sopena has authored 58 papers receiving a total of 882 indexed citations (citations by other indexed papers that have themselves been cited), including 52 papers in Computational Theory and Mathematics, 25 papers in Discrete Mathematics and Combinatorics and 6 papers in Electrical and Electronic Engineering. Recurrent topics in Éric Sopena's work include Advanced Graph Theory Research (43 papers), Graph Labeling and Dimension Problems (36 papers) and Limits and Structures in Graph Theory (24 papers). Éric Sopena is often cited by papers focused on Advanced Graph Theory Research (43 papers), Graph Labeling and Dimension Problems (36 papers) and Limits and Structures in Graph Theory (24 papers). Éric Sopena collaborates with scholars based in France, Russia and Poland. Éric Sopena's co-authors include André Raspaud, Alexandr Kostochka, Jaroslav Nešetřil, Xuding Zhu, O. V. Borodin, Alexandre Pinlou, Julien Bensmail, Paul Dorbec, Ingo Schiermeyer and Pascal Ochem and has published in prestigious journals such as Theoretical Computer Science, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Éric Sopena

53 papers receiving 815 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Éric Sopena France	15	823	467	165	88	77	58	882
Margit Voigt Germany	13	610 0.7×	246 0.5×	143 0.9×	65 0.7×	127 1.6×	44	651
Michael Stiebitz Germany	14	504 0.6×	366 0.8×	79 0.5×	150 1.7×	31 0.4×	51	555
Frédéric Havet France	16	675 0.8×	282 0.6×	209 1.3×	67 0.8×	62 0.8×	96	746
V. Neumann‐Lara Mexico	15	562 0.7×	311 0.7×	91 0.6×	291 3.3×	35 0.5×	40	654
Dan Archdeacon United States	15	443 0.5×	209 0.4×	194 1.2×	161 1.8×	138 1.8×	55	603
Jochen Harant Germany	13	408 0.5×	151 0.3×	75 0.5×	112 1.3×	64 0.8×	62	448
Kristina Vušković United Kingdom	15	577 0.7×	246 0.5×	98 0.6×	91 1.0×	18 0.2×	48	632
Tomáš Kaiser Czechia	12	348 0.4×	194 0.4×	73 0.4×	109 1.2×	41 0.5×	60	404
Chı́nh T. Hoàng Canada	18	895 1.1×	389 0.8×	144 0.9×	150 1.7×	42 0.5×	78	957
R. E. L. Aldred New Zealand	13	465 0.6×	184 0.4×	158 1.0×	131 1.5×	81 1.1×	76	543

Countries citing papers authored by Éric Sopena

Since Specialization

Citations

This map shows the geographic impact of Éric Sopena'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 Éric Sopena with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Éric Sopena more than expected).

Fields of papers citing papers by Éric Sopena

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Éric Sopena. 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 Éric Sopena. The network helps show where Éric Sopena may publish in the future.

Co-authorship network of co-authors of Éric Sopena

This figure shows the co-authorship network connecting the top 25 collaborators of Éric Sopena. A scholar is included among the top collaborators of Éric Sopena 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 Éric Sopena. Éric Sopena 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

Bonamy, Marthe, et al.. (2023). Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable. Journal of Graph Theory. 104(1). 17–86. 1 indexed citations

Bensmail, Julien, et al.. (2020). From light edges to strong edge-colouring of 1-planar graphs. Discrete Mathematics & Theoretical Computer Science. vol. 22 no. 1(Graph Theory). 2 indexed citations

Bensmail, Julien, et al.. (2019). A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions. Discrete Mathematics & Theoretical Computer Science. vol. 21 no. 1, ICGT 2018. 2 indexed citations

Sopena, Éric, et al.. (2018). Strong rainbow connection in digraphs. Discrete Applied Mathematics. 238. 133–143. 3 indexed citations

Duffy, Christopher, Gary MacGillivray, & Éric Sopena. (2018). Oriented colourings of graphs with maximum degree three and four. Discrete Mathematics. 342(4). 959–974. 2 indexed citations

Bensmail, Julien, et al.. (2018). Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1–2–3 Conjecture. Discrete Applied Mathematics. 251. 83–92. 1 indexed citations

Pilśniak, Monika, et al.. (2017). Equitable neighbour-sum-distinguishing edge and total colourings. Discrete Applied Mathematics. 222. 40–53. 4 indexed citations

Bensmail, Julien, et al.. (2015). On the complexity of determining the irregular chromatic index of a graph. Journal of Discrete Algorithms. 30. 113–127. 13 indexed citations

Sopena, Éric. (2015). Homomorphisms and colourings of oriented graphs: An updated survey. Discrete Mathematics. 339(7). 1993–2005. 20 indexed citations

10.

Dorbec, Paul, et al.. (2014). Rainbow connection in oriented graphs. Discrete Applied Mathematics. 179. 69–78. 18 indexed citations

11.

Sopena, Éric, et al.. (2006). On the oriented chromatic number of graphs with given excess. Discrete Mathematics. 306(13). 1342–1350. 4 indexed citations

12.

Sopena, Éric. (2001). Oriented graph coloring. Discrete Mathematics. 229(1-3). 359–369. 46 indexed citations

13.

Borodin, O. V., D. Fon-Der-Flaass, Alexandr Kostochka, André Raspaud, & Éric Sopena. (2001). On Deeply Critical Oriented Graphs. Journal of Combinatorial Theory Series B. 81(1). 150–155. 9 indexed citations

14.

Kostochka, Alexandr, et al.. (1999). On the maximum average degree and the oriented chromatic number of a graph. Discrete Mathematics. 206(1-3). 77–89. 63 indexed citations

15.

Nešetřil, Jaroslav, et al.. (1998). On universal graphs for planar oriented graphs of a given girth. Discrete Mathematics. 188(1-3). 73–85. 11 indexed citations

16.

Nešetřil, Jaroslav, et al.. (1997). $T$-preserving homomorphisms of oriented graphs. Commentationes Mathematicae Universitatis Carolinae. 38(1). 125–136. 4 indexed citations

17.

Kostochka, Alexandr, Éric Sopena, & Xuding Zhu. (1997). Acyclic and oriented chromatic numbers of graphs. Journal of Graph Theory. 24(4). 331–340. 61 indexed citations

18.

Nešetřil, Jaroslav, André Raspaud, & Éric Sopena. (1997). Colorings and girth of oriented planar graphs. Discrete Mathematics. 165-166. 519–530. 49 indexed citations

19.

Sopena, Éric. (1997). The chromatic number of oriented graphs. Journal of Graph Theory. 25(3). 191–206. 67 indexed citations

20.

Sopena, Éric. (1991). Hypermap rewriting: a combinatorial approach. Theoretical Computer Science. 85(2). 253–281.

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