The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Keith Edwards: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  16. The complexity of some graph colouring problems. [Citation Graph (, )][DBLP]


  17. Preface. [Citation Graph (, )][DBLP]


  18. Planarization and fragmentability of some classes of graphs. [Citation Graph (, )][DBLP]


Search in 0.174secs, Finished in 0.175secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002