Nicolas Lichiardopol
-
- Limits and Structures in Graph Theory 15
-
- Advanced Graph Theory Research 18
- Graph Labeling and Dimension Problems 3
-
- Graph theory and applications 6
-
- graph theory and CDMA systems 8
-
- Coding theory and cryptography 3
-
- Optimization and Search Problems 2
-
- Advanced Algebra and Geometry 2
- Co-authors
- Jean‐Sébastien SereniAttila PórStéphane BessyPieter MoreePatrick SoléYoungJu ChoieMichael A. HenningGeňa Hahn
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsAlgebra and Number Theory
- Journals
- Discrete Mathematics (11 papers)SIAM Journal on Discrete Mathematics (2 papers)Discrete Applied Mathematics (2 papers)
- Partner nations
- FranceSouth AfricaCzechia
In The Last Decade
Nicolas Lichiardopol
22 papers receiving 103 citations
Peers
Comparison fields: 5 of 23
- Discrete Mathematics and Combinatorics 65
- Computational Theory and Mathematics 86
- Algebra and Number Theory 14
- Geometry and Topology 21
- Electrical and Electronic Engineering 55
Countries citing papers authored by Nicolas Lichiardopol
This map shows the geographic impact of Nicolas Lichiardopol'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 Lichiardopol with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nicolas Lichiardopol more than expected).
Fields of papers citing papers by Nicolas Lichiardopol
This network shows the impact of papers produced by Nicolas Lichiardopol. 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 Lichiardopol. The network helps show where Nicolas Lichiardopol may publish in the future.
Co-authorship network
The 14 scholars most cited alongside Nicolas Lichiardopol, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2021 | 2 | |
| 2 | 2017 | 1 | |
| 3 | 2015 | 1 | |
| 4 | 2015 | 2 | |
| 5 | 2015 | 1 | |
| 6 | 2014 | 1 | |
| 7 | 2013 | 1 | |
| 8 | 2012 | 4 | |
| 9 | On a conjecture on total domination in claw-free cubic graphs: proof and new upper bound. | 2011 | 5 |
| 10 | 2011 | 4 | |
| 11 | 2010 | 4 | |
| 12 | 2010 | 9 | |
| 13 | 2009 | 14 | |
| 14 | 2008 | 1 | |
| 15 | 2008 | 16 | |
| 16 | 2007 | 2 | |
| 17 | 2006 | 7 | |
| 18 | 2005 | 3 | |
| 19 | 2003 | 1 | |
| 20 | 2003 | 1 |
About Nicolas Lichiardopol
Nicolas Lichiardopol is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Mathematical Physics and Algebra and Number Theory, having authored 23 papers that have together received 118 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (18 papers), Limits and Structures in Graph Theory (15 papers), graph theory and CDMA systems (8 papers), Graph theory and applications (6 papers), Coding theory and cryptography (3 papers), Graph Labeling and Dimension Problems (3 papers), Optimization and Search Problems (2 papers) and Advanced Algebra and Geometry (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (65 citations), Computational Theory and Mathematics (86 citations), Algebra and Number Theory (14 citations), Geometry and Topology (21 citations) and Electrical and Electronic Engineering (55 citations). Nicolas Lichiardopol has collaborated with scholars based in France, South Africa and Czechia. Frequent co-authors include Jean‐Sébastien Sereni, Attila Pór, Stéphane Bessy, Pieter Moree, Patrick Solé, YoungJu Choie, Michael A. Henning, Geňa Hahn, Marcin Kamiński and Reza Naserasr. Their work appears in journals such as Discrete Mathematics, SIAM Journal on Discrete Mathematics, Discrete Applied Mathematics, Journal of Graph Theory and Journal of Combinatorial Optimization.
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.