Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Edwards, Keith"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Achromatic number of fragmentable graphs
Keith Edwards
Journal of Graph Theory
65
(2), 2010, pp. 94-114
On the neighbour-distinguishing index of a graph
Keith Edwards
,
Mirko Horn̑ák
,
Mariusz Woźniak
Graphs and Combinatorics
22
(3), 2006, pp. 341-350
Redundancy based detection of sequence polymorphisms in expressed sequence tag data using autoSNP
Gary Barker
,
Jacqueline Batley
,
Helen O'Sullivan
,
Keith J. Edwards
,
David Edwards
Bioinformatics
19
(3), 2003, pp. 421-422
An algorithm for finding large induced planar subgraphs
Keith Edwards
,
Graham Farr
Lecture Notes in Computer Science
2265
, 2002, pp. 75-83
Fragmentability of graphs
Keith Edwards
,
Graham Farr
Journal of Combinatorial Theory Series B
82
(1), 2001, pp. 30-37
A new upper bound for the harmonious chromatic number
Keith Edwards
Journal of Graph Theory
29
(4), 1998, pp. 257-261
Some results on the achromatic number
Niall Cairnie
,
Keith Edwards
Journal of Graph Theory
26
(3), 1997, pp. 129-136
The complexity of harmonious colouring for trees
Keith Edwards
,
Colin McDiarmid
Discrete Applied Mathematics
57
, 1995, pp. 133-144
New upper bounds on harmonious colorings
Keith Edwards
,
Colin McDiarmid
Journal of Graph Theory
18
(3), 1994, pp. 257-267
The complexity of some graph colouring problems
Keith Edwards
Discrete Applied Mathematics
36
, 1992, pp. 131-140