| Publication | Date of Publication | Type |
|---|
Reconfiguring homomorphisms to reflexive graphs via a simple reduction
European Journal of Combinatorics | 2026-01-29 | Paper |
The complexity of adaptably k-colouring edge-coloured hypergraphs
Kyungpook Mathematical Journal | 2025-10-08 | Paper |
On geometric realizations of the extreme Khovanov homology of pretzel links
Topology and its Applications | 2025-07-21 | Paper |
Mixing is hard for triangle-free reflexive graphs
European Journal of Combinatorics | 2024-02-05 | Paper |
| Towards a dichotomy for the list switch homomorphism problem for signed graphs | 2024-01-29 | Paper |
Recolouring homomorphisms to triangle-free reflexive graphs
Journal of Algebraic Combinatorics | 2023-03-02 | Paper |
| Complexity Framework for Forbidden Subgraphs II: When Hardness Is Not Preserved under Edge Subdivision | 2022-11-25 | Paper |
| A Brightwell-Winkler type characterisation of NU graphs | 2022-08-08 | Paper |
Graph homomorphism reconfiguration and frozen \(H\)-colorings
Journal of Graph Theory | 2022-03-31 | Paper |
A reflexive digraph that is retraction trivial but not endomorphism trivial
Discrete Mathematics | 2022-01-13 | Paper |
Reconfiguration of homomorphisms to reflexive digraph cycles
Discrete Mathematics | 2021-06-14 | Paper |
On the representations of finite distributive lattices
(available as arXiv preprint) | 2020-10-05 | Paper |
Reconfiguring graph homomorphisms on the sphere
European Journal of Combinatorics | 2020-04-09 | Paper |
AK-type stability theorems on cross \(t\)-intersecting families
European Journal of Combinatorics | 2019-08-30 | Paper |
Reflexive graphs with near unanimity but no semilattice polymorphisms
The Electronic Journal of Combinatorics | 2018-10-30 | Paper |
A complexity dichotomy for signed \(\mathbf{H}\)-colouring
Discrete Mathematics | 2018-08-15 | Paper |
Distributive lattice polymorphisms on reflexive graphs
(available as arXiv preprint) | 2018-07-10 | Paper |
Recolouring reflexive digraphs
Discrete Mathematics | 2018-04-19 | Paper |
NU polymorphisms on reflexive digraphs
SIAM Journal on Discrete Mathematics | 2018-04-06 | Paper |
Towards extending the Ahlswede-Khachatrian theorem to cross \(t\)-intersecting families
Discrete Applied Mathematics | 2017-03-15 | Paper |
Characterisation of forests with trivial game domination numbers
Journal of Combinatorial Optimization | 2016-10-12 | Paper |
On a question of Dirac on critical and vertex critical graphs
Sibirskie Elektronnye Matematicheskie Izvestiya | 2015-11-16 | Paper |
Decompositions of graphs into trees, forests, and regular subgraphs
Discrete Mathematics | 2015-04-29 | Paper |
An Erdős-Ko-Rado theorem for cross t-intersecting families
Journal of Combinatorial Theory. Series A | 2014-10-07 | Paper |
Graphs admitting \(k\)-NU operations. II: The irreflexive case
SIAM Journal on Discrete Mathematics | 2014-09-26 | Paper |
Locally injective k-colourings of planar graphs
Discrete Applied Mathematics | 2014-08-22 | Paper |
Graphs admitting \(k\)-NU operations. I: The reflexive case
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
Five Cycles are Highly Ramsey Infinite
Kyungpook mathematical journal | 2014-04-04 | Paper |
Semilattice polymorphisms and chordal graphs
European Journal of Combinatorics | 2014-03-25 | Paper |
Non-bipartite pairs of 3-connected graphs are highly Ramsey-infinite
European Journal of Combinatorics | 2014-03-25 | Paper |
The maximum size of intersecting and union families of sets
European Journal of Combinatorics | 2012-01-11 | Paper |
A strong Mal'cev condition for locally finite varieties omitting the unary type
Algebra Universalis | 2011-01-07 | Paper |
A new proof of the \(H\)-coloring dichotomy
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Potentially \(H\)-bigraphic sequences
Discussiones Mathematicae Graph Theory | 2010-05-14 | Paper |
Note on robust critical graphs with large odd girth
Discrete Mathematics | 2010-03-29 | Paper |
On the complexity of \(H\)-colouring planar graphs
Discrete Mathematics | 2009-12-15 | Paper |
A combinatorial constraint satisfaction problem dichotomy classification conjecture
European Journal of Combinatorics | 2009-12-01 | Paper |
On Ramsey Minimal Graphs
SIAM Journal on Discrete Mathematics | 2009-05-27 | Paper |
Dichotomy for bounded degree \(H\)-colouring
Discrete Applied Mathematics | 2009-03-04 | Paper |
On highly ramsey infinite graphs
Journal of Graph Theory | 2009-02-20 | Paper |
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Integer and fractional packings of hypergraphs
Journal of Combinatorial Theory. Series B | 2007-02-13 | Paper |
Color critical hypergraphs with many edges
Journal of Graph Theory | 2006-09-12 | Paper |
Towards a dichotomy for the switch list homomorphism problem for signed graphs
(available as arXiv preprint) | N/A | Paper |
On geometric realizations of the extreme Khovanov homology of pretzel links
(available as arXiv preprint) | N/A | Paper |
