Matej Stehlík

21 papers Journal 21
YearRankTypeTitle / Venue / Authors
2024 J jnl
Criticality in Sperner's Lemma.
Comb.
Tomás Kaiser, Matej Stehlík, Riste Skrekovski
2023 J jnl
On the Contractibility of Random Vietoris-Rips Complexes.
Discret. Comput. Geom.
Tobias Müller, Matej Stehlík
2022 J jnl
Edge-critical subgraphs of Schrijver graphs II: The general case.
J. Comb. Theory B
Tomás Kaiser, Matej Stehlík
2020 J jnl
Bipartite complements of circle graphs.
Discret. Math.
Louis Esperet, Matej Stehlík
2020 J jnl
Edge-critical subgraphs of Schrijver graphs.
J. Comb. Theory B
Tomás Kaiser, Matej Stehlík
2019 J jnl
Generalised Mycielski Graphs and the Borsuk-Ulam Theorem.
Electron. J. Comb.
Tobias Müller, Matej Stehlík
2018 J jnl
Packing and covering odd cycles in cubic plane graphs with small faces.
Eur. J. Comb.
Diego Nicodemos, Matej Stehlík
2018 J jnl
The width of quadrangulations of the projective plane.
J. Graph Theory
Louis Esperet, Matej Stehlík
2017 J jnl
Packing and covering odd cycles in cubic plane graphs with small faces.
Electron. Notes Discret. Math.
Diego Nicodemos, Matej Stehlík
2015 J jnl
Colouring quadrangulations of projective spaces.
J. Comb. Theory B
Tomás Kaiser, Matej Stehlík
2014 J jnl
Replication in critical graphs and the persistence of monomial ideals.
J. Comb. Theory A
Tomás Kaiser, Matej Stehlík, Riste Skrekovski
2014 J jnl
Strong parity vertex coloring of plane graphs.
Discret. Math. Theor. Comput. Sci.
Tomás Kaiser, Ondrej Rucký, Matej Stehlík, Riste Skrekovski
2012 J jnl
Odd Cycle Transversals and Independent Sets in Fullerene Graphs.
SIAM J. Discret. Math.
Luérbio Faria, Sulamita Klein, Matej Stehlík
2011 J jnl
Edge-face coloring of plane graphs with maximum degree nine.
J. Graph Theory
Jean-Sébastien Sereni, Matej Stehlík
2011 J jnl
Every Plane Graph of Maximum Degree 8 has an Edge-Face 9-Coloring.
SIAM J. Discret. Math.
Ross J. Kang, Jean-Sébastien Sereni, Matej Stehlík
2011 J jnl
On the 2-Resonance of Fullerenes.
SIAM J. Discret. Math.
Tomás Kaiser, Matej Stehlík, Riste Skrekovski
2008 J jnl
Coloring of Triangle-Free Graphs on the Double Torus.
SIAM J. Discret. Math.
Daniel Král, Matej Stehlík
2007 J jnl
A hypergraph version of the Gallai-Edmonds Theorem.
Electron. Notes Discret. Math.
Matej Stehlík
2006 J jnl
Minimal Connected
Graphs Comb.
Matej Stehlík
2004 J jnl
A generalisation of matching and colouring.
Discret. Math.
Matej Stehlík
2003 J jnl
Critical graphs with connected complements.
J. Comb. Theory B
Matej Stehlík