Mark H. Siggers
According to our database^{1},
Mark H. Siggers
authored at least 24 papers
between 2006 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2018
NU Polymorphisms on Reflexive Digraphs.
SIAM J. Discrete Math., 2018
A complexity dichotomy for signed Hcolouring.
Discrete Mathematics, 2018
Recolouring reflexive digraphs.
Discrete Mathematics, 2018
Reflexive Graphs with Near Unanimity but no Semilattice Polymorphisms.
Electr. J. Comb., 2018
2017
Towards extending the AhlswedeKhachatrian theorem to cross tintersecting families.
Discrete Applied Mathematics, 2017
2016
Characterisation of forests with trivial game domination numbers.
J. Comb. Optim., 2016
2015
Decompositions of graphs into trees, forests, and regular subgraphs.
Discrete Mathematics, 2015
2014
Graphs Admitting kNU Operations. Part 2: The Irreflexive Case.
SIAM J. Discrete Math., 2014
An ErdősKoRado theorem for cross tintersecting families.
J. Comb. Theory, Ser. A, 2014
Nonbipartite pairs of 33connected graphs are highly Ramseyinfinite.
Eur. J. Comb., 2014
Semilattice polymorphisms and chordal graphs.
Eur. J. Comb., 2014
Locally injective kcolourings of planar graphs.
Discrete Applied Mathematics, 2014
2013
Graphs Admitting kNU Operations. Part 1: The Reflexive Case.
SIAM J. Discrete Math., 2013
2012
The maximum size of intersecting and union families of sets.
Eur. J. Comb., 2012
2010
A combinatorial constraint satisfaction problem dichotomy classification conjecture.
Eur. J. Comb., 2010
Note on robust critical graphs with large odd girth.
Discrete Mathematics, 2010
2009
Potentially Hbigraphic sequences.
Discussiones Mathematicae Graph Theory, 2009
On the complexity of Hcolouring planar graphs.
Discrete Mathematics, 2009
Dichotomy for bounded degree Hcolouring.
Discrete Applied Mathematics, 2009
2008
On Ramsey Minimal Graphs.
SIAM J. Discrete Math., 2008
On highly ramsey infinite graphs.
Journal of Graph Theory, 2008
2007
Integer and fractional packings of hypergraphs.
J. Comb. Theory, Ser. B, 2007
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NPComplete.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007
2006
Color critical hypergraphs with many edges.
Journal of Graph Theory, 2006