Research Output per year

## Fingerprint Fingerprint is based on mining the text of the person's scientific documents to create an index of weighted terms, which defines the key subjects of each individual researcher.

Coloring
Engineering & Materials Science

Chromatic number
Mathematics

Colouring
Mathematics

Graph in graph theory
Mathematics

Achromatic number
Mathematics

Vertex Coloring
Mathematics

Color
Engineering & Materials Science

Simple Graph
Mathematics

## Research Output 1992 2016

## A faster polynomial-space algorithm for Max 2-CSP

Edwards, K. May 2016 In : Journal of Computer and System Sciences. 82, 3, p. 536-550 15 p.Research output: Contribution to journal › Article

Open Access

File

Polynomials

Polynomial

Cubic Graph

Deletion

Fast Algorithm

## A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP

Edwards, K. & McDermid, E. Aug 2015 In : Algorithmica. 72, 4, p. 940-968 29 p.Research output: Contribution to journal › Article

Open Access

File

Pathwidth

Graph in graph theory

Theorem

Fast Algorithm

Claw-free Graphs

## Achromatic number of collections of paths and cycles

Edwards, K. J. 6 Oct 2013 In : Discrete Mathematics. 313, 19, p. 1856–1860 5 p.Research output: Contribution to journal › Article

Achromatic number

Coloring

Colouring

Cycle

Path

## Harmonious chromatic number of directed graphs

Edwards, K. J. 2013 In : Discrete Applied Mathematics. 161, 3, p. 369-376 8 p.Research output: Contribution to journal › Article

Directed graphs

Coloring

Chromatic number

Directed Graph

Colouring

## Graph fragmentability

Edwards, K. & Farr, G. 2012*Topics in Structural Graph Theory.*Beineke, L. W. & Wilson, R. J. (eds.). Cambridge University Press, p. 203-218 16 p. (Encyclopedia of Mathematics and Its Applications; vol. 147)

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Graph in graph theory

Planarization

Graph Classes

Upper and Lower Bounds

Open Problems