default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatej Stehlík
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Tomás Kaiser, Matej Stehlík, Riste Skrekovski:
Criticality in Sperner's Lemma. Comb. 44(5): 1041-1051 (2024)- 2023
- [j20]Tobias Müller, Matej Stehlík:
On the Contractibility of Random Vietoris-Rips Complexes. Discret. Comput. Geom. 69(4): 1139-1156 (2023) - 2022
- [j19]Tomás Kaiser, Matej Stehlík:
Edge-critical subgraphs of Schrijver graphs II: The general case. J. Comb. Theory B 152: 453-482 (2022) - 2020
- [j18]Louis Esperet
, Matej Stehlík:
Bipartite complements of circle graphs. Discret. Math. 343(6): 111834 (2020) - [j17]Tomás Kaiser, Matej Stehlík:
Edge-critical subgraphs of Schrijver graphs. J. Comb. Theory B 144: 191-196 (2020)
2010 – 2019
- 2019
- [j16]Tobias Müller, Matej Stehlík:
Generalised Mycielski Graphs and the Borsuk-Ulam Theorem. Electron. J. Comb. 26(4): 4 (2019) - 2018
- [j15]Diego Nicodemos, Matej Stehlík:
Packing and covering odd cycles in cubic plane graphs with small faces. Eur. J. Comb. 67: 208-221 (2018) - [j14]Louis Esperet, Matej Stehlík:
The width of quadrangulations of the projective plane. J. Graph Theory 89(1): 76-88 (2018) - 2017
- [j13]Diego Nicodemos, Matej Stehlík:
Packing and covering odd cycles in cubic plane graphs with small faces. Electron. Notes Discret. Math. 61: 925-931 (2017) - 2015
- [j12]Tomás Kaiser, Matej Stehlík:
Colouring quadrangulations of projective spaces. J. Comb. Theory B 113: 1-17 (2015) - 2014
- [j11]Tomás Kaiser, Ondrej Rucký, Matej Stehlík, Riste Skrekovski:
Strong parity vertex coloring of plane graphs. Discret. Math. Theor. Comput. Sci. 16(1): 143-158 (2014) - [j10]Tomás Kaiser, Matej Stehlík, Riste Skrekovski:
Replication in critical graphs and the persistence of monomial ideals. J. Comb. Theory A 123(1): 239-251 (2014) - 2012
- [j9]Luérbio Faria, Sulamita Klein, Matej Stehlík:
Odd Cycle Transversals and Independent Sets in Fullerene Graphs. SIAM J. Discret. Math. 26(3): 1458-1469 (2012) - 2011
- [j8]Jean-Sébastien Sereni, Matej Stehlík:
Edge-face coloring of plane graphs with maximum degree nine. J. Graph Theory 66(4): 332-346 (2011) - [j7]Ross J. Kang, Jean-Sébastien Sereni, Matej Stehlík:
Every Plane Graph of Maximum Degree 8 has an Edge-Face 9-Coloring. SIAM J. Discret. Math. 25(2): 514-533 (2011) - [j6]Tomás Kaiser, Matej Stehlík, Riste Skrekovski:
On the 2-Resonance of Fullerenes. SIAM J. Discret. Math. 25(4): 1737-1745 (2011)
2000 – 2009
- 2008
- [j5]Daniel Král, Matej Stehlík:
Coloring of Triangle-Free Graphs on the Double Torus. SIAM J. Discret. Math. 22(2): 541-553 (2008) - 2007
- [j4]Matej Stehlík:
A hypergraph version of the Gallai-Edmonds Theorem. Electron. Notes Discret. Math. 28: 387-391 (2007) - 2006
- [j3]Matej Stehlík:
Minimal Connected tau-Critical Hypergraphs. Graphs Comb. 22(3): 421-426 (2006) - 2004
- [j2]Matej Stehlík:
A generalisation of matching and colouring. Discret. Math. 285(1-3): 257-265 (2004) - 2003
- [j1]Matej Stehlík:
Critical graphs with connected complements. J. Comb. Theory B 89(2): 189-194 (2003)
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 2025-01-09 12:58 CET 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:
