Keith Edwards

613 total citations
29 papers, 307 citations indexed

About

Keith Edwards is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, Keith Edwards has authored 29 papers receiving a total of 307 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Computational Theory and Mathematics, 8 papers in Discrete Mathematics and Combinatorics and 7 papers in Electrical and Electronic Engineering. Recurrent topics in Keith Edwards's work include Advanced Graph Theory Research (27 papers), Graph Labeling and Dimension Problems (21 papers) and Limits and Structures in Graph Theory (8 papers). Keith Edwards is often cited by papers focused on Advanced Graph Theory Research (27 papers), Graph Labeling and Dimension Problems (21 papers) and Limits and Structures in Graph Theory (8 papers). Keith Edwards collaborates with scholars based in United Kingdom, Australia and Poland. Keith Edwards's co-authors include Colin McDiarmid, Mariusz Woźniak, Mirko Horňák, Paweł Rzążewski, Eric McDermid, Saieed Akbari, Walter Nelson, Mohamed Ibrahim and Jeremy Petch and has published in prestigious journals such as Theoretical Computer Science, Journal of Computer and System Sciences and Discrete Applied Mathematics.

In The Last Decade

Keith Edwards

28 papers receiving 292 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Keith Edwards United Kingdom 10 295 103 86 38 32 29 307
Célia Picinin de Mello Brazil 10 231 0.8× 86 0.8× 49 0.6× 51 1.3× 35 1.1× 30 248
Hongliang Lu China 10 266 0.9× 117 1.1× 60 0.7× 213 5.6× 43 1.3× 49 323
Ko‐Wei Lih Taiwan 10 206 0.7× 110 1.1× 50 0.6× 63 1.7× 30 0.9× 24 260
Louis Esperet France 11 315 1.1× 183 1.8× 41 0.5× 64 1.7× 30 0.9× 51 344
Mirko Horňák Slovakia 13 405 1.4× 141 1.4× 120 1.4× 82 2.2× 12 0.4× 52 452
Daniel W. Cranston United States 12 413 1.4× 185 1.8× 82 1.0× 69 1.8× 33 1.0× 57 459
Reza Naserasr France 10 224 0.8× 98 1.0× 57 0.7× 59 1.6× 29 0.9× 45 260
Luis Cereceda United Kingdom 5 201 0.7× 64 0.6× 30 0.3× 17 0.4× 79 2.5× 7 206
Hossein Hajiabolhassan Iran 10 195 0.7× 124 1.2× 20 0.2× 62 1.6× 10 0.3× 36 224
John Mitchem United States 11 270 0.9× 90 0.9× 58 0.7× 69 1.8× 58 1.8× 29 318

Countries citing papers authored by Keith Edwards

Since Specialization
Citations

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

Fields of papers citing papers by Keith Edwards

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Keith Edwards

This figure shows the co-authorship network connecting the top 25 collaborators of Keith Edwards. A scholar is included among the top collaborators of Keith Edwards 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 Keith Edwards. Keith Edwards 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.
2.
Edwards, Keith & Paweł Rzążewski. (2019). Complete colourings of hypergraphs. Discrete Mathematics. 343(2). 111673–111673. 1 indexed citations
3.
Edwards, Keith. (2015). A faster polynomial-space algorithm for Max 2-CSP. Journal of Computer and System Sciences. 82(3). 536–550. 1 indexed citations
4.
Edwards, Keith, et al.. (2012). Improved Upper Bounds for Planarization and Series-Parallelization of Degree-Bounded Graphs. The Electronic Journal of Combinatorics. 19(2). 4 indexed citations
5.
Edwards, Keith. (2012). Harmonious chromatic number of directed graphs. Discrete Applied Mathematics. 161(3). 369–376. 7 indexed citations
6.
Akbari, Saieed, et al.. (2012). On Harmonious Colouring of Trees. The Electronic Journal of Combinatorics. 19(1). 8 indexed citations
7.
Edwards, Keith, et al.. (2007). Planarization and fragmentability of some classes of graphs. Discrete Mathematics. 308(12). 2396–2406. 10 indexed citations
8.
Edwards, Keith. (2005). Detachments of Complete Graphs. Combinatorics Probability Computing. 14(3). 275–310. 5 indexed citations
9.
Edwards, Keith, et al.. (2004). A new lower bound for the harmonious chromatic number. Discovery Research Portal (University of Dundee). 29. 99–102. 3 indexed citations
10.
Edwards, Keith, et al.. (2001). Fragmentability of Graphs. Journal of Combinatorial Theory Series B. 82(1). 30–37. 22 indexed citations
11.
Edwards, Keith. (2000). Achromatic number versus pseudoachromatic number: a counterexample to a conjecture of Hedetniemi. Discrete Mathematics. 219(1-3). 271–274. 4 indexed citations
12.
Edwards, Keith, et al.. (2000). The computational complexity of cordial and equitable labelling. Discrete Mathematics. 216(1-3). 29–34. 13 indexed citations
13.
Edwards, Keith. (1999). The harmonious chromatic number of complete r-ary trees. Discrete Mathematics. 203(1-3). 83–99. 6 indexed citations
14.
Edwards, Keith, et al.. (1998). The achromatic number of bounded degree trees. Discrete Mathematics. 188(1-3). 87–97. 9 indexed citations
15.
Edwards, Keith, et al.. (1997). Some results on the achromatic number. Journal of Graph Theory. 26(3). 129–136. 17 indexed citations
16.
Edwards, Keith. (1997). The Harmonious Chromatic Number of Bounded Degree Graphs. Journal of the London Mathematical Society. 55(3). 435–447. 12 indexed citations
17.
Edwards, Keith, et al.. (1997). Some results on the achromatic number. Journal of Graph Theory. 26(3). 129–136. 17 indexed citations
18.
Edwards, Keith. (1995). The Harmonious Chromatic Number of Almost All Trees. Combinatorics Probability Computing. 4(1). 31–46. 6 indexed citations
19.
Edwards, Keith & Colin McDiarmid. (1995). The complexity of harmonious colouring for trees. Discrete Applied Mathematics. 57(2-3). 133–144. 26 indexed citations
20.
Edwards, Keith. (1986). The complexity of colouring problems on dense graphs. Theoretical Computer Science. 43. 337–343. 47 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