| 2008 |
|---|
| 18 | EE | Keith Edwards,
Graham Farr:
Planarization and fragmentability of some classes of graphs.
Discrete Mathematics 308(12): 2396-2406 (2008) |
| 17 | EE | Keith Edwards:
Preface.
Discrete Mathematics 308(5-6): 619 (2008) |
| 2006 |
|---|
| 16 | EE | Keith Edwards,
Mirko Hornák,
Mariusz Wozniak:
On the Neighbour-Distinguishing Index of a Graph.
Graphs and Combinatorics 22(3): 341-350 (2006) |
| 2005 |
|---|
| 15 | EE | Keith Edwards:
Detachments of Complete Graphs.
Combinatorics, Probability & Computing 14(3): 275-310 (2005) |
| 14 | EE | Keith Edwards,
Graham Farr:
On monochromatic component size for improper colourings.
Discrete Applied Mathematics 148(1): 89-105 (2005) |
| 2004 |
|---|
| 13 | EE | Ban Al-Ani,
Keith Edwards:
An Empirical Study of a Qualitative Systematic Approach to Requirements Analysis (QSARA).
ISESE 2004: 177-186 |
| 2003 |
|---|
| 12 | EE | Keith Edwards:
Edge decomposition of complete tripartite graphs.
Discrete Mathematics 272(2-3): 269-275 (2003) |
| 2001 |
|---|
| 11 | EE | Keith Edwards,
Graham Farr:
An Algorithm for Finding Large Induced Planar Subgraphs.
Graph Drawing 2001: 75-83 |
| 10 | EE | Keith Edwards,
Graham Farr:
Fragmentability of Graphs.
J. Comb. Theory, Ser. B 82(1): 30-37 (2001) |
| 2000 |
|---|
| 9 | EE | Niall Cairnie,
Keith Edwards:
The computational complexity of cordial and equitable labelling.
Discrete Mathematics 216(1-3): 29-34 (2000) |
| 1999 |
|---|
| 8 | EE | Keith Edwards:
The harmonious chromatic number of complete r-ary trees.
Discrete Mathematics 203(1-3): 83-99 (1999) |
| 1998 |
|---|
| 7 | EE | Niall Cairnie,
Keith Edwards:
The achromatic number of bounded degree trees.
Discrete Mathematics 188(1-3): 87-97 (1998) |
| 1996 |
|---|
| 6 | | Keith Edwards:
The Harmonious Chromatic Number of Bounded Degree Trees.
Combinatorics, Probability & Computing 5: 15-28 (1996) |
| 5 | EE | Keith Edwards:
On a problem concerning piles of counters.
Discrete Mathematics 156(1-3): 263-264 (1996) |
| 1995 |
|---|
| 4 | | Keith Edwards:
The Harmonious Chromatic Number of Almost All Trees.
Combinatorics, Probability & Computing 4: 31-46 (1995) |
| 3 | EE | Keith Edwards,
Colin McDiarmid:
The Complexity of Harmonious Colouring for Trees.
Discrete Applied Mathematics 57(2-3): 133-144 (1995) |
| 1992 |
|---|
| 2 | EE | Keith Edwards:
The complexity of some graph colouring problems.
Discrete Applied Mathematics 36(2): 131-140 (1992) |
| 1986 |
|---|
| 1 | | Keith Edwards:
The Complexity of Colouring Problems on Dense Graphs.
Theor. Comput. Sci. 43: 337-343 (1986) |
