| Publication | Date of Publication | Type |
|---|
Complete colourings of hypergraphs
Discrete Mathematics | 2019-12-17 | Paper |
The complexity of solution-free sets of integers for general linear equations
Discrete Applied Mathematics | 2019-11-06 | Paper |
A faster polynomial-space algorithm for Max 2-CSP
Journal of Computer and System Sciences | 2015-12-30 | Paper |
A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP
Algorithmica | 2015-09-02 | Paper |
Achromatic number of collections of paths and cycles
Discrete Mathematics | 2013-12-06 | Paper |
Harmonious chromatic number of directed graphs
Discrete Applied Mathematics | 2013-01-18 | Paper |
On harmonious colouring of trees
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
Improved upper bounds for planarization and series-parallelization of degree-bounded graphs
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
Achromatic number of fragmentable graphs
Journal of Graph Theory | 2010-11-10 | Paper |
Planarization and fragmentability of some classes of graphs
Discrete Mathematics | 2008-05-13 | Paper |
On the neighbour-distinguishing index of a graph
Graphs and Combinatorics | 2007-01-05 | Paper |
Detachments of Complete Graphs
Combinatorics, Probability and Computing | 2005-06-07 | Paper |
On monochromatic component size for improper colourings
Discrete Applied Mathematics | 2005-05-04 | Paper |
scientific article; zbMATH DE number 2104720 (Why is no real title available?)
| 2004-10-01 | Paper |
scientific article; zbMATH DE number 2084267 (Why is no real title available?)
| 2004-08-06 | Paper |
Edge decomposition of complete tripartite graphs
Discrete Mathematics | 2003-11-25 | Paper |
Fragmentability of graphs
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
The computational complexity of cordial and equitable labelling
Discrete Mathematics | 2000-12-11 | Paper |
The achromatic number of bounded degree trees
Discrete Mathematics | 2000-11-02 | Paper |
Achromatic number versus pseudoachromatic number: A counterexample to a conjecture of Hedetniemi
Discrete Mathematics | 2000-06-21 | Paper |
The harmonious chromatic number of complete \(r\)-ary trees
Discrete Mathematics | 2000-01-05 | Paper |
A new upper bound for the harmonious chromatic number
| 1999-05-11 | Paper |
scientific article; zbMATH DE number 1088659 (Why is no real title available?)
| 1998-03-18 | Paper |
scientific article; zbMATH DE number 1057876 (Why is no real title available?)
| 1998-03-02 | Paper |
The Harmonious Chromatic Number of Bounded Degree Graphs
Journal of the London Mathematical Society | 1996-12-12 | Paper |
On a problem concerning piles of counters
Discrete Mathematics | 1996-10-07 | Paper |
The Harmonious Chromatic Number of Almost All Trees
Combinatorics, Probability and Computing | 1996-07-17 | Paper |
The Harmonious Chromatic Number of Bounded Degree Trees
Combinatorics, Probability and Computing | 1996-07-01 | Paper |
The complexity of harmonious colouring for trees
Discrete Applied Mathematics | 1995-04-10 | Paper |
New upper bounds on harmonious colorings
Journal of Graph Theory | 1994-09-15 | Paper |
The complexity of some graph colouring problems
Discrete Applied Mathematics | 1992-09-27 | Paper |
scientific article; zbMATH DE number 4072216 (Why is no real title available?)
| 1988-01-01 | Paper |
The complexity of colouring problems on dense graphs
Theoretical Computer Science | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3954959 (Why is no real title available?)
| 1985-01-01 | Paper |
