Keith Edwards

	2011
22		Keith Edwards: Preface. Discrete Mathematics 311(13): 1073 (2011)
	2010
21		Wei Jia, Stephen J. McKenna, Annette A. Ward, Keith Edwards: Classifying Textile Designs using Region Graphs. BMVC 2010: 1-10
20		Keith Edwards: Achromatic number of fragmentable graphs. Journal of Graph Theory 65(2): 94-114 (2010)
	2008
19		Keith Edwards, Graham Farr: Planarization and fragmentability of some classes of graphs. Discrete Mathematics 308(12): 2396-2406 (2008)
18		Keith Edwards: Preface. Discrete Mathematics 308(5-6): 619 (2008)
	2006
17		Keith Edwards, Mirko Hornák, Mariusz Wozniak: On the Neighbour-Distinguishing Index of a Graph. Graphs and Combinatorics 22(3): 341-350 (2006)
	2005
16		Keith Edwards: Detachments of Complete Graphs. Combinatorics, Probability & Computing 14(3): 275-310 (2005)
15		Keith Edwards, Graham Farr: On monochromatic component size for improper colourings. Discrete Applied Mathematics 148(1): 89-105 (2005)
	2003
14		Keith Edwards: Edge decomposition of complete tripartite graphs. Discrete Mathematics 272(2-3): 269-275 (2003)
	2001
13		Keith Edwards, Graham Farr: An Algorithm for Finding Large Induced Planar Subgraphs. Graph Drawing 2001: 75-83
12		Keith Edwards, Graham Farr: Fragmentability of Graphs. J. Comb. Theory, Ser. B 82(1): 30-37 (2001)
	2000
11		Niall Cairnie, Keith Edwards: The computational complexity of cordial and equitable labelling. Discrete Mathematics 216(1-3): 29-34 (2000)
	1999
10		Keith Edwards: The harmonious chromatic number of complete r-ary trees. Discrete Mathematics 203(1-3): 83-99 (1999)
	1998
9		Niall Cairnie, Keith Edwards: The achromatic number of bounded degree trees. Discrete Mathematics 188(1-3): 87-97 (1998)
	1996
8		Keith Edwards: The Harmonious Chromatic Number of Bounded Degree Trees. Combinatorics, Probability & Computing 5: 15-28 (1996)
7		Keith Edwards: On a problem concerning piles of counters. Discrete Mathematics 156(1-3): 263-264 (1996)
	1995
6		Keith Edwards: The Harmonious Chromatic Number of Almost All Trees. Combinatorics, Probability & Computing 4: 31-46 (1995)
5		Keith Edwards, Colin McDiarmid: The Complexity of Harmonious Colouring for Trees. Discrete Applied Mathematics 57(2-3): 133-144 (1995)
	1993
4		Nathalie A. Vergeynst, Keith Edwards, John C. Foster, Mervyn A. Jack: Spoken dialogues for human-computer interaction over the telephone: complexity measures. EUROSPEECH 1993
	1992
3		Keith Edwards: The complexity of some graph colouring problems. Discrete Applied Mathematics 36(2): 131-140 (1992)
	1991
2		Keith Edwards, Fergus R. McInnes, Mervyn A. Jack: Accent specific modifications for continuous speech recognition based on a sub-word lattice approach. EUROSPEECH 1991
	1986
1		Keith Edwards: The Complexity of Colouring Problems on Dense Graphs. Theor. Comput. Sci. 43: 337-343 (1986)

Coauthor Index

1	Niall Cairnie	[9] [11]
2	Graham Farr	[12] [13] [15] [19]
3	John C. Foster	[4]
4	Mirko Hornák	[17]
5	Mervyn A. Jack	[2] [4]
6	Wei Jia	[21]
7	Colin McDiarmid (Colin J. H. McDiarmid)	[5]
8	Fergus R. McInnes	[2]
9	Stephen J. McKenna	[21]
10	Nathalie A. Vergeynst	[4]
11	Annette A. Ward	[21]
12	Mariusz Wozniak	[17]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page