default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark H. Siggers
Person information
- affiliation: Kyungpook National University, Daegu, South Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Hyobeen Kim, Jae-Baek Lee, Mark H. Siggers:
Mixing is hard for triangle-free reflexive graphs. Eur. J. Comb. 116: 103860 (2024)- 2023
- [j31]Cheolwon Heo
, Hyobin Kim, Mark H. Siggers:
The Complexity of the Matroid Homomorphism Problem. Electron. J. Comb. 30(2) (2023) - 2022
- [j30]Mark H. Siggers:
A reflexive digraph that is retraction trivial but not endomorphism trivial. Discret. Math. 345(3): 112713 (2022) - 2021
- [j29]Richard C. Brewster, Jae-Baek Lee, Mark H. Siggers:
Reconfiguration of homomorphisms to reflexive digraph cycles. Discret. Math. 344(8): 112441 (2021) - [j28]Jae-Baek Lee, Jonathan A. Noel, Mark H. Siggers:
Corrigendum to "Reconfiguring graph homomorphisms on the sphere" [European J. Combin. 86 (2020) 103086]. Eur. J. Comb. 94: 103296 (2021) - 2020
- [j27]Jae-Baek Lee, Jonathan A. Noel, Mark H. Siggers:
Reconfiguring graph homomorphisms on the sphere. Eur. J. Comb. 86: 103086 (2020) - [j26]Richard C. Brewster, Jae-Baek Lee, Benjamin R. Moore, Jonathan A. Noel, Mark H. Siggers:
Graph homomorphism reconfiguration and frozen H-colorings. J. Graph Theory 94(3): 398-420 (2020)
2010 – 2019
- 2019
- [j25]Sang June Lee, Mark H. Siggers, Norihide Tokushige:
AK-type stability theorems on cross t-intersecting families. Eur. J. Comb. 82 (2019) - 2018
- [j24]Mark H. Siggers:
Reflexive Graphs with Near Unanimity but no Semilattice Polymorphisms. Electron. J. Comb. 25(4): 4 (2018) - [j23]Richard C. Brewster, Jae-Baek Lee, Mark H. Siggers:
Recolouring reflexive digraphs. Discret. Math. 341(6): 1708-1721 (2018) - [j22]Richard C. Brewster, Mark H. Siggers:
A complexity dichotomy for signed H-colouring. Discret. Math. 341(10): 2768-2773 (2018) - [j21]Benoît Larose, Mark H. Siggers:
NU Polymorphisms on Reflexive Digraphs. SIAM J. Discret. Math. 32(1): 728-749 (2018) - [i2]Jae-Baek Lee, Jonathan A. Noel, Mark H. Siggers:
Reconfiguring Graph Homomorphisms on the Sphere. CoRR abs/1810.01111 (2018) - 2017
- [j20]Sangjune Lee, Mark H. Siggers, Norihide Tokushige:
Towards extending the Ahlswede-Khachatrian theorem to cross t-intersecting families. Discret. Appl. Math. 216: 627-645 (2017) - [i1]Richard C. Brewster, Jae-Baek Lee, Benjamin R. Moore, Jonathan A. Noel, Mark H. Siggers:
Graph Homomorphism Reconfiguration and Frozen H-Colourings. CoRR abs/1712.00200 (2017) - 2016
- [j19]Mohammad J. Nadjafi-Arani, Mark H. Siggers, Hossein Soltani:
Characterisation of forests with trivial game domination numbers. J. Comb. Optim. 32(3): 800-811 (2016) - 2015
- [j18]Saieed Akbari, Tommy R. Jensen, Mark H. Siggers:
Decompositions of graphs into trees, forests, and regular subgraphs. Discret. Math. 338(8): 1322-1327 (2015) - 2014
- [j17]Jan Kratochvíl, Mark H. Siggers:
Locally injective k-colourings of planar graphs. Discret. Appl. Math. 173: 53-61 (2014) - [j16]Mark H. Siggers:
Non-bipartite pairs of 33-connected graphs are highly Ramsey-infinite. Eur. J. Comb. 36: 172-189 (2014) - [j15]Pavol Hell, Mark H. Siggers:
Semilattice polymorphisms and chordal graphs. Eur. J. Comb. 36: 694-706 (2014) - [j14]Peter Frankl, Sangjune Lee, Mark H. Siggers, Norihide Tokushige:
An Erdős-Ko-Rado theorem for cross t-intersecting families. J. Comb. Theory A 128: 207-249 (2014) - [j13]Tomás Feder, Pavol Hell, Benoît Larose, Mark H. Siggers, Claude Tardif:
Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case. SIAM J. Discret. Math. 28(2): 817-834 (2014) - 2013
- [j12]Tomás Feder, Pavol Hell, Benoît Larose, Cynthia Loten, Mark H. Siggers, Claude Tardif:
Graphs Admitting k-NU Operations. Part 1: The Reflexive Case. SIAM J. Discret. Math. 27(4): 1940-1963 (2013) - 2012
- [j11]Mark H. Siggers, Norihide Tokushige:
The maximum size of intersecting and union families of sets. Eur. J. Comb. 33(2): 128-138 (2012) - 2010
- [j10]Esmeralda Nastase, Vojtech Rödl, Mark H. Siggers:
Note on robust critical graphs with large odd girth. Discret. Math. 310(3): 499-504 (2010) - [j9]Jaroslav Nesetril, Mark H. Siggers, László Zádori:
A combinatorial constraint satisfaction problem dichotomy classification conjecture. Eur. J. Comb. 31(1): 280-296 (2010) - [j8]Mark H. Siggers:
A New Proof of the H-Coloring Dichotomy. SIAM J. Discret. Math. 23(4): 2204-2210 (2010)
2000 – 2009
- 2009
- [j7]Mark H. Siggers:
Dichotomy for bounded degree H-colouring. Discret. Appl. Math. 157(2): 201-210 (2009) - [j6]Gary MacGillivray, Mark H. Siggers:
On the complexity of H-colouring planar graphs. Discret. Math. 309(18): 5729-5738 (2009) - [j5]Michael J. Ferrara, Michael S. Jacobson, John R. Schmitt, Mark H. Siggers:
Potentially H-bigraphic sequences. Discuss. Math. Graph Theory 29(3): 583-596 (2009) - 2008
- [j4]Mark H. Siggers:
On highly ramsey infinite graphs. J. Graph Theory 59(2): 97-114 (2008) - [j3]Vojtech Rödl, Mark H. Siggers:
On Ramsey Minimal Graphs. SIAM J. Discret. Math. 22(2): 467-488 (2008) - 2007
- [j2]Vojtech Rödl, Mathias Schacht, Mark H. Siggers, Norihide Tokushige:
Integer and fractional packings of hypergraphs. J. Comb. Theory B 97(2): 245-268 (2007) - [c1]Jaroslav Nesetril, Mark H. Siggers:
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete. MFCS 2007: 159-170 - 2006
- [j1]Vojtech Rödl, Mark H. Siggers:
Color critical hypergraphs with many edges. J. Graph Theory 53(1): 56-74 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
