Mark H. Siggers

According to our database, Mark H. Siggers authored at least 34 papers between 2006 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Mixing is hard for triangle-free reflexive graphs.

Hyobeen Kim, Jae-Baek Lee, Mark H. Siggers

Eur. J. Comb., February, 2024

2023

The Complexity of the Matroid Homomorphism Problem.

Cheolwon Heo, Hyobin Kim, Mark H. Siggers

Electron. J. Comb., 2023

2022

A reflexive digraph that is retraction trivial but not endomorphism trivial.

Mark H. Siggers

Discret. Math., 2022

2021

Corrigendum to "Reconfiguring graph homomorphisms on the sphere" [European J. Combin. 86 (2020) 103086].

Jae-Baek Lee, Jonathan A. Noel, Mark H. Siggers

Eur. J. Comb., 2021

Reconfiguration of homomorphisms to reflexive digraph cycles.

Richard C. Brewster, Jae-Baek Lee, Mark H. Siggers

Discret. Math., 2021

2020

Graph homomorphism reconfiguration and frozen H-colorings.

Richard C. Brewster, Jae-Baek Lee, Benjamin R. Moore, Jonathan A. Noel, Mark H. Siggers

J. Graph Theory, 2020

Reconfiguring graph homomorphisms on the sphere.

Jae-Baek Lee, Jonathan A. Noel, Mark H. Siggers

Eur. J. Comb., 2020

2019

AK-type stability theorems on cross t-intersecting families.

Sang June Lee, Mark H. Siggers, Norihide Tokushige

Eur. J. Comb., 2019

2018

NU Polymorphisms on Reflexive Digraphs.

Benoît Larose, Mark H. Siggers

SIAM J. Discret. Math., 2018

A complexity dichotomy for signed H-colouring.

Richard C. Brewster, Mark H. Siggers

Discret. Math., 2018

Recolouring reflexive digraphs.

Richard C. Brewster, Jae-Baek Lee, Mark H. Siggers

Discret. Math., 2018

Reflexive Graphs with Near Unanimity but no Semilattice Polymorphisms.

Mark H. Siggers

Electron. J. Comb., 2018

2017

Towards extending the Ahlswede-Khachatrian theorem to cross t-intersecting families.

Sangjune Lee, Mark H. Siggers, Norihide Tokushige

Discret. Appl. Math., 2017

Graph Homomorphism Reconfiguration and Frozen H-Colourings.

Richard C. Brewster, Jae-Baek Lee, Benjamin R. Moore, Jonathan A. Noel, Mark H. Siggers

CoRR, 2017

2016

Characterisation of forests with trivial game domination numbers.

Mohammad J. Nadjafi-Arani, Mark H. Siggers, Hossein Soltani

J. Comb. Optim., 2016

2015

Decompositions of graphs into trees, forests, and regular subgraphs.

Saieed Akbari, Tommy R. Jensen, Mark H. Siggers

Discret. Math., 2015

2014

Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case.

Tomás Feder, Pavol Hell, Benoît Larose, Mark H. Siggers, Claude Tardif

SIAM J. Discret. Math., 2014

An Erdős-Ko-Rado theorem for cross t-intersecting families.

Peter Frankl, Sangjune Lee, Mark H. Siggers, Norihide Tokushige

J. Comb. Theory, Ser. A, 2014

Non-bipartite pairs of 33-connected graphs are highly Ramsey-infinite.

Mark H. Siggers

Eur. J. Comb., 2014

Semilattice polymorphisms and chordal graphs.

Pavol Hell, Mark H. Siggers

Eur. J. Comb., 2014

Locally injective k-colourings of planar graphs.

Jan Kratochvíl, Mark H. Siggers

Discret. Appl. Math., 2014

2013

Graphs Admitting k-NU Operations. Part 1: The Reflexive Case.

Tomás Feder, Pavol Hell, Benoît Larose, Cynthia Loten, Mark H. Siggers, Claude Tardif

SIAM J. Discret. Math., 2013

2012

The maximum size of intersecting and union families of sets.

Mark H. Siggers, Norihide Tokushige

Eur. J. Comb., 2012

2010

A New Proof of the H-Coloring Dichotomy.

Mark H. Siggers

SIAM J. Discret. Math., 2010

A combinatorial constraint satisfaction problem dichotomy classification conjecture.

Jaroslav Nesetril, Mark H. Siggers, László Zádori

Eur. J. Comb., 2010

Note on robust critical graphs with large odd girth.

Esmeralda Nastase, Vojtech Rödl, Mark H. Siggers

Discret. Math., 2010

2009

Potentially <i>H</i>-bigraphic sequences.

Michael J. Ferrara, Michael S. Jacobson, John R. Schmitt, Mark H. Siggers

Discuss. Math. Graph Theory, 2009

On the complexity of H-colouring planar graphs.

Gary MacGillivray, Mark H. Siggers

Discret. Math., 2009

Dichotomy for bounded degree H-colouring.

Mark H. Siggers

Discret. Appl. Math., 2009

2008

On Ramsey Minimal Graphs.

Vojtech Rödl, Mark H. Siggers

SIAM J. Discret. Math., 2008

On highly ramsey infinite graphs.

Mark H. Siggers

J. Graph Theory, 2008

2007

Integer and fractional packings of hypergraphs.

Vojtech Rödl, Mathias Schacht, Mark H. Siggers, Norihide Tokushige

J. Comb. Theory, Ser. B, 2007

Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete.

Jaroslav Nesetril, Mark H. Siggers

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

Color critical hypergraphs with many edges.

Vojtech Rödl, Mark H. Siggers

J. Graph Theory, 2006