Mark H. Siggers

Orcid: 0000-0001-7070-9021

Affiliations:
  • Kyungpook National University, Daegu, South Korea


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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Mixing is hard for triangle-free reflexive graphs.
Eur. J. Comb., February, 2024

2023
The Complexity of the Matroid Homomorphism Problem.
Electron. J. Comb., 2023

2022
A reflexive digraph that is retraction trivial but not endomorphism trivial.
Discret. Math., 2022

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

Reconfiguration of homomorphisms to reflexive digraph cycles.
Discret. Math., 2021

2020
Graph homomorphism reconfiguration and frozen H-colorings.
J. Graph Theory, 2020

Reconfiguring graph homomorphisms on the sphere.
Eur. J. Comb., 2020

2019
AK-type stability theorems on cross t-intersecting families.
Eur. J. Comb., 2019

2018
NU Polymorphisms on Reflexive Digraphs.
SIAM J. Discret. Math., 2018

A complexity dichotomy for signed H-colouring.
Discret. Math., 2018

Recolouring reflexive digraphs.
Discret. Math., 2018

Reflexive Graphs with Near Unanimity but no Semilattice Polymorphisms.
Electron. J. Comb., 2018

2017
Towards extending the Ahlswede-Khachatrian theorem to cross t-intersecting families.
Discret. Appl. Math., 2017

Graph Homomorphism Reconfiguration and Frozen H-Colourings.
CoRR, 2017

2016
Characterisation of forests with trivial game domination numbers.
J. Comb. Optim., 2016

2015
Decompositions of graphs into trees, forests, and regular subgraphs.
Discret. Math., 2015

2014
Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case.
SIAM J. Discret. Math., 2014

An Erdős-Ko-Rado theorem for cross t-intersecting families.
J. Comb. Theory A, 2014

Non-bipartite pairs of 33-connected graphs are highly Ramsey-infinite.
Eur. J. Comb., 2014

Semilattice polymorphisms and chordal graphs.
Eur. J. Comb., 2014

Locally injective k-colourings of planar graphs.
Discret. Appl. Math., 2014

2013
Graphs Admitting k-NU Operations. Part 1: The Reflexive Case.
SIAM J. Discret. Math., 2013

2012
The maximum size of intersecting and union families of sets.
Eur. J. Comb., 2012

2010
A New Proof of the H-Coloring Dichotomy.
SIAM J. Discret. Math., 2010

A combinatorial constraint satisfaction problem dichotomy classification conjecture.
Eur. J. Comb., 2010

Note on robust critical graphs with large odd girth.
Discret. Math., 2010

2009
Potentially <i>H</i>-bigraphic sequences.
Discuss. Math. Graph Theory, 2009

On the complexity of H-colouring planar graphs.
Discret. Math., 2009

Dichotomy for bounded degree H-colouring.
Discret. Appl. Math., 2009

2008
On Ramsey Minimal Graphs.
SIAM J. Discret. Math., 2008

On highly ramsey infinite graphs.
J. Graph Theory, 2008

2007
Integer and fractional packings of hypergraphs.
J. Comb. Theory B, 2007

Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
Color critical hypergraphs with many edges.
J. Graph Theory, 2006


  Loading...