Mark H. Siggers

39 papers B 2Journal 37

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Reconfiguring homomorphisms to reflexive graphs via a simple reduction. Eur. J. Comb. Moritz Mühlenthaler, Mark H. Siggers, Thomas Suzan
2024	B	`conf`	Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs. ISAAC Vadim V. Lozin, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Mark H. Siggers, Siani Smith, Erik Jan van Leeuwen
2024	J	`jnl`	Graph Homomorphism, Monotone Classes and Bounded Pathwidth. CoRR Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Mark H. Siggers, Siani Smith
2024	J	`jnl`	Mixing is hard for triangle-free reflexive graphs. Eur. J. Comb. Hyobeen Kim, Jae-Baek Lee, Mark H. Siggers
2024	J	`jnl`	Reconfiguring homomorphisms to reflexive graphs via a simple reduction. CoRR Moritz Mühlenthaler, Mark H. Siggers, Thomas Suzan
2023	J	`jnl`	The Complexity of the Matroid Homomorphism Problem. Electron. J. Comb. Cheolwon Heo, Hyobin Kim, Mark H. Siggers
2022	J	`jnl`	A reflexive digraph that is retraction trivial but not endomorphism trivial. Discret. Math. Mark H. Siggers
2021	J	`jnl`	Corrigendum to "Reconfiguring graph homomorphisms on the sphere" [European J. Combin. 86 (2020) 103086]. Eur. J. Comb. Jae-Baek Lee, Jonathan A. Noel, Mark H. Siggers
2021	J	`jnl`	Reconfiguration of homomorphisms to reflexive digraph cycles. Discret. Math. Richard C. Brewster, Jae-Baek Lee, Mark H. Siggers
2020	J	`jnl`	Graph homomorphism reconfiguration and frozen H-colorings. J. Graph Theory Richard C. Brewster, Jae-Baek Lee, Benjamin R. Moore, Jonathan A. Noel, Mark H. Siggers
2020	J	`jnl`	Reconfiguring graph homomorphisms on the sphere. Eur. J. Comb. Jae-Baek Lee, Jonathan A. Noel, Mark H. Siggers
2019	J	`jnl`	AK-type stability theorems on cross t-intersecting families. Eur. J. Comb. Sang June Lee, Mark H. Siggers, Norihide Tokushige
2018	J	`jnl`	A complexity dichotomy for signed H-colouring. Discret. Math. Richard C. Brewster, Mark H. Siggers
2018	J	`jnl`	NU Polymorphisms on Reflexive Digraphs. SIAM J. Discret. Math. Benoît Larose, Mark H. Siggers
2018	J	`jnl`	Recolouring reflexive digraphs. Discret. Math. Richard C. Brewster, Jae-Baek Lee, Mark H. Siggers
2018	J	`jnl`	Reconfiguring Graph Homomorphisms on the Sphere. CoRR Jae-Baek Lee, Jonathan A. Noel, Mark H. Siggers
2018	J	`jnl`	Reflexive Graphs with Near Unanimity but no Semilattice Polymorphisms. Electron. J. Comb. Mark H. Siggers
2017	J	`jnl`	Graph Homomorphism Reconfiguration and Frozen H-Colourings. CoRR Richard C. Brewster, Jae-Baek Lee, Benjamin R. Moore, Jonathan A. Noel, Mark H. Siggers
2017	J	`jnl`	Towards extending the Ahlswede-Khachatrian theorem to cross t-intersecting families. Discret. Appl. Math. Sangjune Lee, Mark H. Siggers, Norihide Tokushige
2016	J	`jnl`	Characterisation of forests with trivial game domination numbers. J. Comb. Optim. Mohammad J. Nadjafi-Arani, Mark H. Siggers, Hossein Soltani
2015	J	`jnl`	Decompositions of graphs into trees, forests, and regular subgraphs. Discret. Math. Saieed Akbari, Tommy R. Jensen, Mark H. Siggers
2014	J	`jnl`	An Erdős-Ko-Rado theorem for cross t-intersecting families. J. Comb. Theory A Peter Frankl, Sangjune Lee, Mark H. Siggers, Norihide Tokushige
2014	J	`jnl`	Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case. SIAM J. Discret. Math. Tomás Feder, Pavol Hell, Benoît Larose, Mark H. Siggers, Claude Tardif
2014	J	`jnl`	Locally injective k-colourings of planar graphs. Discret. Appl. Math. Jan Kratochvíl, Mark H. Siggers
2014	J	`jnl`	Non-bipartite pairs of 33-connected graphs are highly Ramsey-infinite. Eur. J. Comb. Mark H. Siggers
2014	J	`jnl`	Semilattice polymorphisms and chordal graphs. Eur. J. Comb. Pavol Hell, Mark H. Siggers
2013	J	`jnl`	Graphs Admitting k-NU Operations. Part 1: The Reflexive Case. SIAM J. Discret. Math. Tomás Feder, Pavol Hell, Benoît Larose, Cynthia Loten, Mark H. Siggers, Claude Tardif
2012	J	`jnl`	The maximum size of intersecting and union families of sets. Eur. J. Comb. Mark H. Siggers, Norihide Tokushige
2010	J	`jnl`	A New Proof of the H-Coloring Dichotomy. SIAM J. Discret. Math. Mark H. Siggers
2010	J	`jnl`	A combinatorial constraint satisfaction problem dichotomy classification conjecture. Eur. J. Comb. Jaroslav Nesetril, Mark H. Siggers, László Zádori
2010	J	`jnl`	Note on robust critical graphs with large odd girth. Discret. Math. Esmeralda Nastase, Vojtech Rödl, Mark H. Siggers
2009	J	`jnl`	Dichotomy for bounded degree H-colouring. Discret. Appl. Math. Mark H. Siggers
2009	J	`jnl`	On the complexity of H-colouring planar graphs. Discret. Math. Gary MacGillivray, Mark H. Siggers
2009	J	`jnl`	Potentially Discuss. Math. Graph Theory Michael J. Ferrara, Michael S. Jacobson, John R. Schmitt, Mark H. Siggers
2008	J	`jnl`	On Ramsey Minimal Graphs. SIAM J. Discret. Math. Vojtech Rödl, Mark H. Siggers
2008	J	`jnl`	On highly ramsey infinite graphs. J. Graph Theory Mark H. Siggers
2007	B	`conf`	Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete. MFCS Jaroslav Nesetril, Mark H. Siggers
2007	J	`jnl`	Integer and fractional packings of hypergraphs. J. Comb. Theory B Vojtech Rödl, Mathias Schacht, Mark H. Siggers, Norihide Tokushige
2006	J	`jnl`	Color critical hypergraphs with many edges. J. Graph Theory Vojtech Rödl, Mark H. Siggers