Mark H. Siggers

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 15

Top Topics

Graph Theoretic

Winning Strategy

Top Venues

Discret. Appl. Math.

Publications

Hyobeen Kim, Jae-Baek Lee, Mark H. Siggers
Mixing is hard for triangle-free reflexive graphs. Eur. J. Comb. 116 (2024)
Mark H. Siggers
A reflexive digraph that is retraction trivial but not endomorphism trivial. Discret. Math. 345 (3) (2022)
Jae-Baek Lee, Jonathan A. Noel, Mark H. Siggers
Corrigendum to "Reconfiguring graph homomorphisms on the sphere" [European J. Combin. 86 (2020) 103086]. Eur. J. Comb. 94 (2021)
Richard C. Brewster, Jae-Baek Lee, Mark H. Siggers
Reconfiguration of homomorphisms to reflexive digraph cycles. Discret. Math. 344 (8) (2021)
Richard C. Brewster, Jae-Baek Lee, Benjamin Moore, Jonathan A. Noel, Mark H. Siggers
Graph homomorphism reconfiguration and frozen H-colorings. J. Graph Theory 94 (3) (2020)
Jae-Baek Lee, Jonathan A. Noel, Mark H. Siggers
Reconfiguring graph homomorphisms on the sphere. Eur. J. Comb. 86 (2020)
Sang June Lee, Mark H. Siggers, Norihide Tokushige
AK-type stability theorems on cross t-intersecting families. Eur. J. Comb. 82 (2019)
Jae-Baek Lee, Jonathan A. Noel, Mark H. Siggers
Reconfiguring Graph Homomorphisms on the Sphere. CoRR (2018)
Richard C. Brewster, Jae-Baek Lee, Mark H. Siggers
Recolouring reflexive digraphs. Discret. Math. 341 (6) (2018)
Benoît Larose, Mark H. Siggers
NU Polymorphisms on Reflexive Digraphs. SIAM J. Discret. Math. 32 (1) (2018)
Richard C. Brewster, Mark H. Siggers
A complexity dichotomy for signed H-colouring. Discret. Math. 341 (10) (2018)
Mark H. Siggers
Reflexive Graphs with Near Unanimity but no Semilattice Polymorphisms. Electron. J. Comb. 25 (4) (2018)
Sangjune Lee, Mark H. Siggers, Norihide Tokushige
Towards extending the Ahlswede-Khachatrian theorem to cross t-intersecting families. Discret. Appl. Math. 216 (2017)
Richard C. Brewster, Jae-Baek Lee, Benjamin Moore, Jonathan A. Noel, Mark H. Siggers
Graph Homomorphism Reconfiguration and Frozen H-Colourings. CoRR (2017)
Mohammad J. Nadjafi-Arani, Mark H. Siggers, Hossein Soltani
Characterisation of forests with trivial game domination numbers. J. Comb. Optim. 32 (3) (2016)
Saieed Akbari, Tommy R. Jensen, Mark H. Siggers
Decompositions of graphs into trees, forests, and regular subgraphs. Discret. Math. 338 (8) (2015)
Pavol Hell, Mark H. Siggers
Semilattice polymorphisms and chordal graphs. Eur. J. Comb. 36 (2014)
Mark H. Siggers
Non-bipartite pairs of 33-connected graphs are highly Ramsey-infinite. Eur. J. Comb. 36 (2014)
Jan Kratochvíl, Mark H. Siggers
Locally injective k-colourings of planar graphs. Discret. Appl. Math. 173 (2014)
Peter Frankl, Sangjune Lee, Mark H. Siggers, Norihide Tokushige
An Erdős-Ko-Rado theorem for cross t-intersecting families. J. Comb. Theory, Ser. A 128 (2014)
Tomás Feder, Pavol Hell, Benoît Larose, Mark H. Siggers, Claude Tardif
Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case. SIAM J. Discret. Math. 28 (2) (2014)
Tomás Feder, Pavol Hell, Benoît Larose, Cynthia Loten, Mark H. Siggers, Claude Tardif
Graphs Admitting k-NU Operations. Part 1: The Reflexive Case. SIAM J. Discret. Math. 27 (4) (2013)
Mark H. Siggers, Norihide Tokushige
The maximum size of intersecting and union families of sets. Eur. J. Comb. 33 (2) (2012)
Jaroslav Nesetril, Mark H. Siggers, László Zádori
A combinatorial constraint satisfaction problem dichotomy classification conjecture. Eur. J. Comb. 31 (1) (2010)
Mark H. Siggers
A New Proof of the H-Coloring Dichotomy. SIAM J. Discret. Math. 23 (4) (2010)
Esmeralda Nastase, Vojtech Rödl, Mark H. Siggers
Note on robust critical graphs with large odd girth. Discret. Math. 310 (3) (2010)
Gary MacGillivray, Mark H. Siggers
On the complexity of H-colouring planar graphs. Discret. Math. 309 (18) (2009)
Michael J. Ferrara, Michael S. Jacobson, John R. Schmitt, Mark H. Siggers
-bigraphic sequences. Discuss. Math. Graph Theory 29 (3) (2009)
Mark H. Siggers
Dichotomy for bounded degree H-colouring. Discret. Appl. Math. 157 (2) (2009)
Vojtech Rödl, Mark H. Siggers
On Ramsey Minimal Graphs. SIAM J. Discret. Math. 22 (2) (2008)
Mark H. Siggers
On highly ramsey infinite graphs. J. Graph Theory 59 (2) (2008)
Vojtech Rödl, Mathias Schacht, Mark H. Siggers, Norihide Tokushige
Integer and fractional packings of hypergraphs. J. Comb. Theory, Ser. B 97 (2) (2007)
Jaroslav Nesetril, Mark H. Siggers
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete. MFCS (2007)
Vojtech Rödl, Mark H. Siggers
Color critical hypergraphs with many edges. J. Graph Theory 53 (1) (2006)