M. N. Ellingham
Impact in
-
- Limits and Structures in Graph Theory
- Finite Group Theory Research
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
Papers in
-
- Limits and Structures in Graph Theory 11
- Finite Group Theory Research 7
-
- Computational Geometry and Mesh Generation 9
- Co-authors
- Luis GoddynDiane StephensZhicheng GaoJoseph D. HortonYair CaroGordon RoyleDavid H. J. BunkaHeinz‐Jürgen Voss
- Journals
- Journal of Graph Theory (14 papers)Journal of Combinatorial Theory Series B (9 papers)Discrete Mathematics (4 papers)Graphs and Combinatorics (3 papers)COMBINATORICA (2 papers)
- Partner nations
- United StatesCanadaJapan
In The Last Decade
M. N. Ellingham
52 papers receiving 449 citations
Peers
Comparison fields: 5 of 68
- Discrete Mathematics and Combinatorics 159
- Computational Theory and Mathematics 359
- Geometry and Topology 180
- Music 39
- Computer Graphics and Computer-Aided Design 41
Countries citing papers authored by M. N. Ellingham
This map shows the geographic impact of M. N. Ellingham'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 M. N. Ellingham with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites M. N. Ellingham more than expected).
Fields of papers citing papers by M. N. Ellingham
This network shows the impact of papers produced by M. N. Ellingham. 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 M. N. Ellingham. The network helps show where M. N. Ellingham may publish in the future.
Co-authorship network
The 25 scholars most cited alongside M. N. Ellingham, 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 | 2022 | 1 | |
| 2 | 2012 | 3 | |
| 3 | 2011 | 1 | |
| 4 | 2008 | 11 | |
| 5 | 2006 | 3 | |
| 6 | 2006 | 19 | |
| 7 | The Rough Guide to world music. | 2006 | 4 |
| 8 | 2005 | 11 | |
| 9 | 2004 | 5 | |
| 10 | A characterisation of cubic parity graphs. | 2003 | 2 |
| 11 | 2000 | 45 | |
| 12 | The Rough Guide to Italy | 1999 | 5 |
| 13 | Cycles in quasi 4-connected graphs. | 1997 | 1 |
| 14 | Rock : the rough guide | 1996 | 1 |
| 15 | 1995 | 17 | |
| 16 | 1994 | 14 | |
| 17 | Basic subgraphs and graph spectra. | 1993 | 56 |
| 18 | A Characterization of Well-covered Cubic Graphs | 1993 | 12 |
| 19 | 1992 | 5 | |
| 20 | 1983 | 16 |
About M. N. Ellingham
M. N. Ellingham is a scholar working on Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics, Computational Mathematics and Geometry and Topology, having authored 57 papers that have together received 501 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (37 papers), graph theory and CDMA systems (14 papers), Interconnection Networks and Systems (12 papers), Graph Labeling and Dimension Problems (11 papers), Limits and Structures in Graph Theory (11 papers), Computational Geometry and Mesh Generation (9 papers), Finite Group Theory Research (7 papers) and Graph theory and applications (7 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (159 citations), Computational Theory and Mathematics (359 citations), Geometry and Topology (180 citations), Music (39 citations) and Computer Graphics and Computer-Aided Design (41 citations). M. N. Ellingham has collaborated with scholars based in United States, Canada and Japan. Frequent co-authors include Luis Goddyn, Diane Stephens, Zhicheng Gao, Joseph D. Horton, Yair Caro, Gordon Royle, David H. J. Bunka, Heinz‐Jürgen Voss, Derek Holton and David J. Rowlands. Their work appears in journals such as Journal of Graph Theory, Journal of Combinatorial Theory Series B, Discrete Mathematics, Graphs and Combinatorics and COMBINATORICA.
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.