Nicolas Trotignon

626 total citations
38 papers, 205 citations indexed

About

Nicolas Trotignon is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, Nicolas Trotignon has authored 38 papers receiving a total of 205 indexed citations (citations by other indexed papers that have themselves been cited), including 38 papers in Computational Theory and Mathematics, 23 papers in Discrete Mathematics and Combinatorics and 8 papers in Electrical and Electronic Engineering. Recurrent topics in Nicolas Trotignon's work include Advanced Graph Theory Research (37 papers), Limits and Structures in Graph Theory (22 papers) and Graph Labeling and Dimension Problems (19 papers). Nicolas Trotignon is often cited by papers focused on Advanced Graph Theory Research (37 papers), Limits and Structures in Graph Theory (22 papers) and Graph Labeling and Dimension Problems (19 papers). Nicolas Trotignon collaborates with scholars based in France, United Kingdom and United States. Nicolas Trotignon's co-authors include Frédéric Maffray, Benjamin Lévêque, Kristina Vušković, Stéphan Thomassé, Pierre Charbit, Raphael C. S. Machado, Celina M.H. de Figueiredo, Maria Chudnovsky, Alex Scott and András Gyárfás and has published in prestigious journals such as Theoretical Computer Science, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Nicolas Trotignon

33 papers receiving 198 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Nicolas Trotignon France 10 202 107 32 24 23 38 205
Benjamin Lévêque France 8 156 0.8× 68 0.6× 34 1.1× 18 0.8× 24 1.0× 28 167
Marthe Bonamy France 9 175 0.9× 86 0.8× 29 0.9× 28 1.2× 33 1.4× 34 188
Deepak Rajendraprasad India 6 166 0.8× 78 0.7× 39 1.2× 22 0.9× 34 1.5× 24 172
Edita Máčajová Slovakia 9 193 1.0× 113 1.1× 30 0.9× 49 2.0× 46 2.0× 46 207
Robert Šámal Czechia 7 133 0.7× 98 0.9× 14 0.4× 26 1.1× 66 2.9× 34 165
Luke Postle Canada 6 110 0.5× 80 0.7× 14 0.4× 15 0.6× 24 1.0× 35 116
T. Karthick India 10 228 1.1× 136 1.3× 13 0.4× 20 0.8× 45 2.0× 32 237
Jean‐Luc Fouquet France 8 254 1.3× 124 1.2× 70 2.2× 42 1.8× 66 2.9× 32 263
Hoàng-Oanh Le Germany 10 199 1.0× 57 0.5× 58 1.8× 12 0.5× 52 2.3× 17 204
Mostafa Blidia Algeria 9 202 1.0× 48 0.4× 51 1.6× 14 0.6× 33 1.4× 35 211

Countries citing papers authored by Nicolas Trotignon

Since Specialization
Citations

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

Fields of papers citing papers by Nicolas Trotignon

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Nicolas Trotignon

This figure shows the co-authorship network connecting the top 25 collaborators of Nicolas Trotignon. A scholar is included among the top collaborators of Nicolas Trotignon 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 Nicolas Trotignon. Nicolas Trotignon is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Cook, L. F., et al.. (2024). Graphs with all holes the same length. Journal of Combinatorial Theory Series B. 168. 96–158. 1 indexed citations
2.
Havet, Frédéric, et al.. (2017). Coloring Graphs with Constraints on Connectivity. HAL (Le Centre pour la Communication Scientifique Directe). 4 indexed citations
3.
Adler, Isolde, et al.. (2017). On rank-width of even-hole-free graphs. Discrete Mathematics & Theoretical Computer Science. Vol. 19 no. 1(Graph Theory).
4.
Milanič, Martin & Nicolas Trotignon. (2016). Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs. Journal of Graph Theory. 84(4). 536–551.
5.
Charbit, Pierre, et al.. (2015). Perfect graphs of arbitrarily large clique-chromatic number. Journal of Combinatorial Theory Series B. 116. 456–464. 14 indexed citations
6.
Charbit, Pierre, et al.. (2015). Vertex elimination orderings for hereditary graph classes. Discrete Mathematics. 338(5). 825–834. 9 indexed citations
7.
Li, Zhentao, Raphael C. S. Machado, & Nicolas Trotignon. (2014). Complements of nearly perfect graphs. 3 indexed citations
8.
Machado, Raphael C. S., Celina M.H. de Figueiredo, & Nicolas Trotignon. (2013). Edge-colouring and total-colouring chordless graphs. Discrete Mathematics. 313(14). 1547–1552. 8 indexed citations
9.
Charbit, Pierre, et al.. (2012). LexBFS, structure and algorithms. arXiv (Cornell University). 1 indexed citations
10.
Gyárfás, András, et al.. (2012). The chromatic gap and its extremes. Journal of Combinatorial Theory Series B. 102(5). 1155–1178. 9 indexed citations
11.
Machado, Raphael C. S., Celina M.H. de Figueiredo, & Nicolas Trotignon. (2012). Complexity of colouring problems restricted to unichord-free and { square,unichord }-free graphs. Discrete Applied Mathematics. 164. 191–199. 4 indexed citations
12.
Lévêque, Benjamin, Frédéric Maffray, & Nicolas Trotignon. (2012). On graphs with no induced subdivision of K4. Journal of Combinatorial Theory Series B. 102(4). 924–947. 12 indexed citations
13.
Bang‐Jensen, Jørgen, Frédéric Havet, & Nicolas Trotignon. (2012). Finding an induced subdivision of a digraph. Theoretical Computer Science. 443. 10–24. 2 indexed citations
14.
Trotignon, Nicolas & Kristina Vušković. (2011). On Roussel–Rubio-type lemmas and their consequences. Discrete Mathematics. 311(8-9). 684–687.
15.
Trotignon, Nicolas, et al.. (2011). Combinatorial optimization with 2-joins. Journal of Combinatorial Theory Series B. 102(1). 153–185. 7 indexed citations
16.
Liu, Weijun & Nicolas Trotignon. (2010). The k-in-a-tree problem for graphs of girth at least k. Discrete Applied Mathematics. 158(15). 1644–1649. 4 indexed citations
17.
Lévêque, Benjamin, et al.. (2009). Detecting induced subgraphs. Discrete Applied Mathematics. 157(17). 3540–3551. 21 indexed citations
18.
Maffray, Frédéric, Nicolas Trotignon, & Kristina Vušković. (2008). Algorithms for square-3PC($\\cdot, \\cdot$)-free Berge graphs. White Rose Research Online (University of Leeds, The University of Sheffield, University of York). 7 indexed citations
19.
Trotignon, Nicolas. (2007). Decomposing Berge graphs and detecting balanced skew partitions. Journal of Combinatorial Theory Series B. 98(1). 173–225. 10 indexed citations
20.
Maffray, Frédéric, Nicolas Trotignon, & Kristina Vušković. (2006). Algorithms for square-3PC(.,.)-free Berge graphs. White Rose Research Online (University of Leeds, The University of Sheffield, University of York). 2 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

Rankless by CCL
2026