A strong Mal’cev condition for locally finite varieties omitting the unary type MH Siggers
Algebra universalis 64 (1), 15-20, 2010
105 2010 Characterisation of forests with trivial game domination numbers MJ Nadjafi-Arani, M Siggers, H Soltani
Journal of Combinatorial Optimization 32 (3), 800-811, 2016
38 2016 An Erdős–Ko–Rado theorem for cross t-intersecting families P Frankl, SJ Lee, M Siggers, N Tokushige
Journal of Combinatorial Theory, Series A 128, 207-249, 2014
34 2014 Integer and fractional packings of hypergraphs V Rödl, M Schacht, MH Siggers, N Tokushige
Journal of Combinatorial Theory, Series B 97 (2), 245-268, 2007
24 2007 A complexity dichotomy for signed H-colouring RC Brewster, M Siggers
Discrete Mathematics 341 (10), 2768-2773, 2018
23 2018 On Ramsey minimal graphs V Rödl, M Siggers
SIAM Journal on Discrete Mathematics 22 (2), 467-488, 2008
23 2008 Decompositions of graphs into trees, forests, and regular subgraphs S Akbari, TR Jensen, M Siggers
Discrete Mathematics 338 (8), 1322-1327, 2015
22 2015 A New Proof of the H -Coloring Dichotomy MH Siggers
SIAM Journal on Discrete Mathematics 23 (4), 2204-2210, 2010
21 2010 On the complexity of H-colouring planar graphs G MacGillivray, M Siggers
Discrete mathematics 309 (18), 5729-5738, 2009
19 2009 A combinatorial constraint satisfaction problem dichotomy classification conjecture J Nešetřil, MH Siggers, L Zádori
European Journal of Combinatorics 31 (1), 280-296, 2010
17 2010 On highly Ramsey infinite graphs MH Siggers
Journal of Graph Theory 59 (2), 97-114, 2008
13 2008 Graphs Admitting -NU Operations. Part 1: The Reflexive Case T Feder, P Hell, B Larose, C Loten, M Siggers, C Tardif
SIAM Journal on Discrete Mathematics 27 (4), 1940-1963, 2013
12 2013 Dichotomy for bounded degree H-colouring MH Siggers
Discrete applied mathematics 157 (2), 201-210, 2009
10 2009 Potentially H-bigraphic sequences M Ferrara, M Jacobson, J Schmitt, M Siggers
Discussiones Mathematicae Graph Theory 29 (3), 583-596, 2009
10 2009 Graph homomorphism reconfiguration and frozen ‐colorings RC Brewster, JB Lee, B Moore, JA Noel, M Siggers
Journal of Graph Theory 94 (3), 398-420, 2020
8 2020 Non-bipartite pairs of 3-connected graphs are highly Ramsey-infinite M Siggers
European Journal of Combinatorics 36, 172-189, 2014
8 2014 Recolouring reflexive digraphs RC Brewster, JB Lee, M Siggers
Discrete Mathematics 341 (6), 1708-1721, 2018
7 2018 On the representation of finite distributive lattices M Siggers
arXiv preprint arXiv:1412.0011, 2014
7 2014 Color critical hypergraphs with many edges V Rödl, M Siggers
Journal of Graph Theory 53 (1), 56-74, 2006
7 2006 Locally injective k-colourings of planar graphs J Kratochvil, M Siggers
Discrete Applied Mathematics 173, 53-61, 2014
6 2014