• 341 Citations
  • 10 h-Index
1992 …2020

Research output per year

If you made any changes in Pure these will be visible here soon.

Research Output

  • 341 Citations
  • 10 h-Index
  • 29 Article
  • 3 Editorial
  • 2 Chapter
  • 2 Conference contribution
1992

The complexity of some graph colouring problems

Edwards, K., 1992, In : Discrete Applied Mathematics. 36, 2, p. 131-140 10 p.

Research output: Contribution to journalArticle

3 Citations (Scopus)
1994

New upper bounds on harmonious colourings

Edwards, K. & McDiarmid, C., 1994, In : Journal of Graph Theory. 18, 3, p. 257-267 11 p.

Research output: Contribution to journalArticle

25 Citations (Scopus)
1995

The complexity of harmonious colouring for trees

Edwards, K. & McDiarmid, C., 1995, In : Discrete Applied Mathematics. 57, 2-3, p. 133-144 12 p.

Research output: Contribution to journalArticle

45 Citations (Scopus)

The harmonious chromatic number of almost all trees

Edwards, K., 1995, In : Combinatorics, Probability and Computing. 4, 1, p. 31-46 16 p.

Research output: Contribution to journalArticle

Open Access
File
11 Citations (Scopus)
281 Downloads (Pure)
1996

On a problem concerning piles of counters

Edwards, K., 1996, In : Discrete Mathematics. 156, 1-3, p. 263-264 2 p.

Research output: Contribution to journalArticle

The harmonious chromatic number of bounded degree trees

Edwards, K., 1996, In : Combinatorics, Probability and Computing. 5, 1, p. 15-28 14 p.

Research output: Contribution to journalArticle

13 Citations (Scopus)
1997

Some Results on the Achromatic Number

Cairnie, N. & Edwards, K., 1997, In : Journal of Graph Theory. 26, 3, p. 129-136 8 p.

Research output: Contribution to journalArticle

34 Citations (Scopus)

The harmonious chromatic number and the achromatic number

Edwards, K., 1997, Surveys in combinatorics, 1997. Bailey, R. A. (ed.). Cambridge University Press, p. 13-48 36 p. (London Mathematical Society Lecture Note Series; vol. 241).

Research output: Chapter in Book/Report/Conference proceedingChapter

The harmonious chromatic number of bounded degree graphs

Edwards, K., 1997, In : Journal of the London Mathematical Society. 55, 3, p. 435-447 13 p.

Research output: Contribution to journalArticle

16 Citations (Scopus)
1998

A new upper bound for the harmonious chromatic number

Edwards, K., 1998, In : Journal of Graph Theory. 29, 4, p. 257-261 5 p.

Research output: Contribution to journalArticle

6 Citations (Scopus)

The achromatic number of bounded degree trees

Cairnie, N. & Edwards, K., 1998, In : Discrete Mathematics. 188, 1-3, p. 87-97 11 p.

Research output: Contribution to journalArticle

10 Citations (Scopus)
1999

The harmonious chromatic number of complete r-ary trees

Edwards, K., 1999, In : Discrete Mathematics. 203, 1-3, p. 83-99 17 p.

Research output: Contribution to journalArticle

7 Citations (Scopus)
2000

Achromatic number versus pseudoachromatic number: A counterexample to a conjecture of Hedetniemi

Edwards, K. J., 28 May 2000, In : Discrete Mathematics. 219, 1-3, p. 271-274 4 p.

Research output: Contribution to journalArticle

8 Citations (Scopus)

The computational complexity of cordial and equitable labelling

Cairnie, N. & Edwards, K., 2000, In : Discrete Mathematics. 216, 1-3, p. 29-34 6 p.

Research output: Contribution to journalArticle

35 Citations (Scopus)
2001

Fragmentability of graphs

Edwards, K. & Farr, G., May 2001, In : Journal of Combinatorial Theory, Series B. 82, 1, p. 30-37 8 p.

Research output: Contribution to journalArticle

20 Citations (Scopus)
2002

An algorithm for finding large induced planar subgraphs

Edwards, K. & Farr, G., 2002, Graph Drawing : 9th International Symposium, GD 2001 Vienna, Austria, September 23–26, 2001 Revised Papers. Mutzel, P., Junger, M. & Leipert, S. (eds.). Berlin: Springer , p. 75-83 9 p. (Lecture notes in computer science ; vol. 2265).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)
2003

Edge decomposition of complete tripartite graphs

Edwards, K., Nov 2003, In : Discrete Mathematics. 272, 2-3, p. 269-275 7 p.

Research output: Contribution to journalArticle

2004

A new lower bound for the harmonious chromatic number

Campbell, D. & Edwards, K., 2004, In : Australasian Journal of Combinatorics. 29, p. 99-102 4 p.

Research output: Contribution to journalArticle

6 Citations (Scopus)
2005

Detachments of complete graphs

Edwards, K., 2005, In : Combinatorics, Probability and Computing. 14, 3, p. 275-310 36 p.

Research output: Contribution to journalArticle

4 Citations (Scopus)

On monochromatic component size for improper colourings

Edwards, K. & Farr, G., Apr 2005, In : Discrete Applied Mathematics. 148, 1, p. 89-105 17 p.

Research output: Contribution to journalArticle

2 Citations (Scopus)
2006

On the neighbour-distinguishing index of a graph

Edwards, K., Horňák, M. & Woźniak, M., 2006, In : Graphs and Combinatorics. 22, 3, p. 341-350 10 p.

Research output: Contribution to journalArticle

47 Citations (Scopus)
2008

Planarization and fragmentability of some classes of graphs

Edwards, K. & Farr, G., 28 Jun 2008, In : Discrete Mathematics. 308, 12, p. 2396-2406 11 p.

Research output: Contribution to journalArticle

12 Citations (Scopus)

Special issue: selected papers from 20th British Combinatorial Conference - preface

Edwards, K., 28 Mar 2008, In : Discrete Mathematics. 308, 5-6, p. 619-619 1 p.

Research output: Contribution to journalEditorial

2010

Achromatic number of fragmentable graphs

Edwards, K., Oct 2010, In : Journal of Graph Theory. 65, 2, p. 94-114 21 p.

Research output: Contribution to journalArticle

4 Citations (Scopus)

Classifying textile designs using region graphs

Jia, W., McKenna, S., Ward, A. & Edwards, K., 2010, British Machine Vision Conference. British Machine Vision Association and Society for Pattern Recognition, 10 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Open Access
File
492 Downloads (Pure)

Special Issue: selected papers from the 21st British Combinatorial Conference preface

Edwards, K. J., Griggs, T. S., van den Heuvel, J., Perkins, S., Webb, B. S. & Zverovich, V., 28 Jan 2010, In : Discrete Mathematics. 310, 2, p. 197-198 2 p.

Research output: Contribution to journalEditorial

2011

Special Issue: selected papers from the 22nd British Combinatorial Conference preface

Edwards, K., 6 Jul 2011, In : Discrete Mathematics. 311, 13, p. 1073-1073 1 p.

Research output: Contribution to journalEditorial

2012

Graph fragmentability

Edwards, K. & Farr, G., 2012, Topics in Structural Graph Theory. Beineke, L. W. & Wilson, R. J. (eds.). Cambridge University Press, p. 203-218 16 p. (Encyclopedia of Mathematics and Its Applications; vol. 147).

Research output: Chapter in Book/Report/Conference proceedingChapter

Improved upper bounds for planarization and series-parallelization of degree-bounded graphs

Edwards, K. & Farr, G., 31 May 2012, In : Electronic Journal of Combinatorics. 19, 2, 19 p., P25.

Research output: Contribution to journalArticle

6 Citations (Scopus)

On Harmonious Colouring of Trees

Aflaki, A., Akbari, S., Edwards, K. J., Eskandani, D. S., Jamaali, M. & Ravanbod, H., 2012, In : Electronic Journal of Combinatorics. 19, 1, p. - 9 p., P3.

Research output: Contribution to journalArticle

6 Citations (Scopus)
2013

Achromatic number of collections of paths and cycles

Edwards, K. J., 6 Oct 2013, In : Discrete Mathematics. 313, 19, p. 1856–1860 5 p.

Research output: Contribution to journalArticle

Harmonious chromatic number of directed graphs

Edwards, K. J., 2013, In : Discrete Applied Mathematics. 161, 3, p. 369-376 8 p.

Research output: Contribution to journalArticle

7 Citations (Scopus)
2015

A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP

Edwards, K. & McDermid, E., Aug 2015, In : Algorithmica. 72, 4, p. 940-968 29 p.

Research output: Contribution to journalArticle

Open Access
File
3 Citations (Scopus)
263 Downloads (Pure)
2016

A faster polynomial-space algorithm for Max 2-CSP

Edwards, K., May 2016, In : Journal of Computer and System Sciences. 82, 3, p. 536-550 15 p.

Research output: Contribution to journalArticle

Open Access
File
2 Citations (Scopus)
133 Downloads (Pure)
2019

The complexity of solution-free sets of integers for general linear equations

Edwards, K. & Noble, S. D., 1 Nov 2019, In : Discrete Applied Mathematics. 270, p. 115-133 19 p.

Research output: Contribution to journalArticle

Open Access
File
5 Downloads (Pure)
2020

Complete colourings of hypergraphs

Edwards, K. & Rzążewski, P., Feb 2020, In : Discrete Mathematics. 343, 2, p. 1-12 12 p., 111673.

Research output: Contribution to journalArticle

1 Citation (Scopus)