Keith J. Edwards

Available identifiers

zbMath Open edwards.keith-jMaRDI QIDQ383737

List of research outcomes

Publication	Date of Publication	Type
Complete colourings of hypergraphs	2019-12-17	Paper
The complexity of solution-free sets of integers for general linear equations	2019-11-06	Paper
A faster polynomial-space algorithm for Max 2-CSP	2015-12-30	Paper
A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP	2015-09-02	Paper
Achromatic number of collections of paths and cycles	2013-12-06	Paper
Harmonious chromatic number of directed graphs	2013-01-18	Paper
On harmonious colouring of trees	2012-06-12	Paper
Improved upper bounds for planarization and series-parallelization of degree-bounded graphs	2012-06-12	Paper
Achromatic number of fragmentable graphs	2010-11-10	Paper
Planarization and fragmentability of some classes of graphs	2008-05-13	Paper
On the neighbour-distinguishing index of a graph	2007-01-05	Paper
Detachments of Complete Graphs	2005-06-07	Paper
On monochromatic component size for improper colourings	2005-05-04	Paper
https://portal.mardi4nfdi.de/entity/Q4818789	2004-10-01	Paper
https://portal.mardi4nfdi.de/entity/Q3043706	2004-08-06	Paper
Edge decomposition of complete tripartite graphs	2003-11-25	Paper
Fragmentability of graphs	2002-12-10	Paper
The computational complexity of cordial and equitable labelling	2000-12-11	Paper
The achromatic number of bounded degree trees	2000-11-02	Paper
Achromatic number versus pseudoachromatic number: A counterexample to a conjecture of Hedetniemi	2000-06-21	Paper
The harmonious chromatic number of complete \(r\)-ary trees	2000-01-05	Paper
A new upper bound for the harmonious chromatic number	1999-05-11	Paper
https://portal.mardi4nfdi.de/entity/Q4364806	1998-03-18	Paper
https://portal.mardi4nfdi.de/entity/Q4352945	1998-03-02	Paper
The Harmonious Chromatic Number of Bounded Degree Graphs	1996-12-12	Paper
On a problem concerning piles of counters	1996-10-07	Paper
The Harmonious Chromatic Number of Almost All Trees	1996-07-17	Paper
The Harmonious Chromatic Number of Bounded Degree Trees	1996-07-01	Paper
The complexity of harmonious colouring for trees	1995-04-10	Paper
New upper bounds on harmonious colorings	1994-09-15	Paper
The complexity of some graph colouring problems	1992-09-27	Paper
https://portal.mardi4nfdi.de/entity/Q3804062	1988-01-01	Paper
The complexity of colouring problems on dense graphs	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3724369	1985-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Keith J. Edwards