Keith Edwards

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Graham Farr

> Home > Persons > Keith Edwards

Publications

2012
[j23]
- view
  authority control:
- export record
  dblp key:
  - journals/combinatorics/EdwardsF12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorics/EdwardsF12
Keith Edwards, Graham Farr:
Improved Upper Bounds for Planarization and Series-Parallelization of Degree-Bounded Graphs. Electron. J. Comb. 19(2): 25 (2012)
2008
[j19]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/dm/EdwardsF08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/EdwardsF08
Keith Edwards, Graham Farr:
Planarization and fragmentability of some classes of graphs. Discret. Math. 308(12): 2396-2406 (2008)
2005
[j16]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/dam/EdwardsF05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/EdwardsF05
Keith Edwards, Graham Farr:
On monochromatic component size for improper colourings. Discret. Appl. Math. 148(1): 89-105 (2005)
2001
[j13]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jct/EdwardsF01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/EdwardsF01
Keith Edwards, Graham Farr:
Fragmentability of Graphs. J. Comb. Theory B 82(1): 30-37 (2001)
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/gd/EdwardsF01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gd/EdwardsF01
Keith Edwards, Graham Farr:
An Algorithm for Finding Large Induced Planar Subgraphs. GD 2001: 75-83

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.