Matej Stehlík

According to our database, Matej Stehlík authored at least 19 papers between 2003 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

On the Contractibility of Random Vietoris-Rips Complexes.

Tobias Müller, Matej Stehlík

Discret. Comput. Geom., June, 2023

2022

Edge-critical subgraphs of Schrijver graphs II: The general case.

Tomás Kaiser, Matej Stehlík

J. Comb. Theory, Ser. B, 2022

2020

Edge-critical subgraphs of Schrijver graphs.

Tomás Kaiser, Matej Stehlík

J. Comb. Theory, Ser. B, 2020

Bipartite complements of circle graphs.

Louis Esperet, Matej Stehlík

Discret. Math., 2020

2019

Generalised Mycielski Graphs and the Borsuk-Ulam Theorem.

Tobias Müller, Matej Stehlík

Electron. J. Comb., 2019

2018

The width of quadrangulations of the projective plane.

Louis Esperet, Matej Stehlík

J. Graph Theory, 2018

2017

Packing and covering odd cycles in cubic plane graphs with small faces.

Diego Nicodemos, Matej Stehlík

Electron. Notes Discret. Math., 2017

2015

Colouring quadrangulations of projective spaces.

Tomás Kaiser, Matej Stehlík

J. Comb. Theory, Ser. B, 2015

2014

Replication in critical graphs and the persistence of monomial ideals.

Tomás Kaiser, Matej Stehlík, Riste Skrekovski

J. Comb. Theory, Ser. A, 2014

Strong parity vertex coloring of plane graphs.

Tomás Kaiser, Ondrej Rucký, Matej Stehlík, Riste Skrekovski

Discret. Math. Theor. Comput. Sci., 2014

2012

Odd Cycle Transversals and Independent Sets in Fullerene Graphs.

Luérbio Faria, Sulamita Klein, Matej Stehlík

SIAM J. Discret. Math., 2012

2011

Every Plane Graph of Maximum Degree 8 has an Edge-Face 9-Coloring.

Ross J. Kang, Jean-Sébastien Sereni, Matej Stehlík

SIAM J. Discret. Math., 2011

On the 2-Resonance of Fullerenes.

Tomás Kaiser, Matej Stehlík, Riste Skrekovski

SIAM J. Discret. Math., 2011

Edge-face coloring of plane graphs with maximum degree nine.

Jean-Sébastien Sereni, Matej Stehlík

J. Graph Theory, 2011

2008

Coloring of Triangle-Free Graphs on the Double Torus.

Daniel Král, Matej Stehlík

SIAM J. Discret. Math., 2008

2007

A hypergraph version of the Gallai-Edmonds Theorem.

Matej Stehlík

Electron. Notes Discret. Math., 2007

2006

Minimal Connected <i>tau</i>-Critical Hypergraphs.

Matej Stehlík

Graphs Comb., 2006

2004

A generalisation of matching and colouring.

Matej Stehlík

Discret. Math., 2004

2003

Critical graphs with connected complements.

Matej Stehlík

J. Comb. Theory, Ser. B, 2003