Mark H. Siggers

Orcid: 0000-0001-7070-9021

Affiliations:

Kyungpook National University, Daegu, South Korea

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

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Mixing is hard for triangle-free reflexive graphs.

[BibT_eX]

[DOI]

Hyobeen Kim

Jae-Baek Lee

Mark H. Siggers

Eur. J. Comb., February, 2024

Reconfiguring homomorphisms to reflexive graphs via a simple reduction.

[BibT_eX]

[DOI]

Moritz Mühlenthaler

Mark H. Siggers

Thomas Suzan

CoRR, 2024

Graph Homomorphism, Monotone Classes and Bounded Pathwidth.

[BibT_eX]

[DOI]

CoRR, 2024

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

2023

The Complexity of the Matroid Homomorphism Problem.

[BibT_eX]

[DOI]

Cheolwon Heo

Hyobin Kim

Mark H. Siggers

Electron. J. Comb., 2023

2022

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

[BibT_eX]

[DOI]

Mark H. Siggers

Discret. Math., 2022

2021

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

[BibT_eX]

[DOI]

Jae-Baek Lee

Jonathan A. Noel

Mark H. Siggers

Eur. J. Comb., 2021

Reconfiguration of homomorphisms to reflexive digraph cycles.

[BibT_eX]

[DOI]

Richard C. Brewster

Jae-Baek Lee

Mark H. Siggers

Discret. Math., 2021

2020

Graph homomorphism reconfiguration and frozen H-colorings.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Reconfiguring graph homomorphisms on the sphere.

[BibT_eX]

[DOI]

Jae-Baek Lee

Jonathan A. Noel

Mark H. Siggers

Eur. J. Comb., 2020

2019

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

[BibT_eX]

[DOI]

Sang June Lee

Mark H. Siggers

Norihide Tokushige

Eur. J. Comb., 2019

2018

NU Polymorphisms on Reflexive Digraphs.

[BibT_eX]

[DOI]

Benoît Larose

Mark H. Siggers

SIAM J. Discret. Math., 2018

A complexity dichotomy for signed H-colouring.

[BibT_eX]

[DOI]

Richard C. Brewster

Mark H. Siggers

Discret. Math., 2018

Recolouring reflexive digraphs.

[BibT_eX]

[DOI]

Richard C. Brewster

Jae-Baek Lee

Mark H. Siggers

Discret. Math., 2018

Reflexive Graphs with Near Unanimity but no Semilattice Polymorphisms.

[BibT_eX]

[DOI]

Mark H. Siggers

Electron. J. Comb., 2018

2017

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

[BibT_eX]

[DOI]

Sangjune Lee

Mark H. Siggers

Norihide Tokushige

Discret. Appl. Math., 2017

Graph Homomorphism Reconfiguration and Frozen H-Colourings.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Characterisation of forests with trivial game domination numbers.

[BibT_eX]

[DOI]

Mohammad J. Nadjafi-Arani

Mark H. Siggers

Hossein Soltani

J. Comb. Optim., 2016

2015

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

[BibT_eX]

[DOI]

Saieed Akbari

Tommy R. Jensen

Mark H. Siggers

Discret. Math., 2015

2014

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

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

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

[BibT_eX]

[DOI]

J. Comb. Theory A, 2014

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

[BibT_eX]

[DOI]

Mark H. Siggers

Eur. J. Comb., 2014

Semilattice polymorphisms and chordal graphs.

[BibT_eX]

[DOI]

Pavol Hell

Mark H. Siggers

Eur. J. Comb., 2014

Locally injective k-colourings of planar graphs.

[BibT_eX]

[DOI]

Jan Kratochvíl

Mark H. Siggers

Discret. Appl. Math., 2014

2013

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

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

2012

The maximum size of intersecting and union families of sets.

[BibT_eX]

[DOI]

Mark H. Siggers

Norihide Tokushige

Eur. J. Comb., 2012

2010

A New Proof of the H-Coloring Dichotomy.

[BibT_eX]

[DOI]

Mark H. Siggers

SIAM J. Discret. Math., 2010

A combinatorial constraint satisfaction problem dichotomy classification conjecture.

[BibT_eX]

[DOI]

Jaroslav Nesetril

Mark H. Siggers

László Zádori

Eur. J. Comb., 2010

Note on robust critical graphs with large odd girth.

[BibT_eX]

[DOI]

Esmeralda Nastase

Vojtech Rödl

Mark H. Siggers

Discret. Math., 2010

2009

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

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2009

On the complexity of H-colouring planar graphs.

[BibT_eX]

[DOI]

Gary MacGillivray

Mark H. Siggers

Discret. Math., 2009

Dichotomy for bounded degree H-colouring.

[BibT_eX]

[DOI]

Mark H. Siggers

Discret. Appl. Math., 2009

2008

On Ramsey Minimal Graphs.

[BibT_eX]

[DOI]

Vojtech Rödl

Mark H. Siggers

SIAM J. Discret. Math., 2008

On highly ramsey infinite graphs.

[BibT_eX]

[DOI]

Mark H. Siggers

J. Graph Theory, 2008

2007

Integer and fractional packings of hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

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

[BibT_eX]

[DOI]

Jaroslav Nesetril

Mark H. Siggers

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

Color critical hypergraphs with many edges.

[BibT_eX]

[DOI]

Vojtech Rödl

Mark H. Siggers

J. Graph Theory, 2006

Mark H. Siggers

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...