Matej Stehlík - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 20 from 20

2023

On the Contractibility of Random Vietoris-Rips ComplexesTobias Müller, Matej Stehlík. dcg, 69(4):1139-1156, June 2023. [doi]

2022

Edge-critical subgraphs of Schrijver graphs II: The general caseTomás Kaiser, Matej Stehlík. jctb, 152:453-482, 2022. [doi]

2020

Bipartite complements of circle graphsLouis Esperet, Matej Stehlík. DM, 343(6):111834, 2020. [doi]

Edge-critical subgraphs of Schrijver graphsTomás Kaiser, Matej Stehlík. jctb, 144:191-196, 2020. [doi]

2019

Generalised Mycielski Graphs and the Borsuk-Ulam TheoremTobias Müller, Matej Stehlík. combinatorics, 26(4):4, 2019. [doi]

2018

The width of quadrangulations of the projective planeLouis Esperet, Matej Stehlík. jgt, 89(1):76-88, 2018. [doi]

Packing and covering odd cycles in cubic plane graphs with small facesDiego Nicodemos, Matej Stehlík. ejc, 67:208-221, 2018. [doi]

2017

Packing and covering odd cycles in cubic plane graphs with small facesDiego Nicodemos, Matej Stehlík. endm, 61:925-931, 2017. [doi]

2015

Colouring quadrangulations of projective spacesTomás Kaiser, Matej Stehlík. JCT, 113:1-17, 2015. [doi]

2014

Strong parity vertex coloring of plane graphsTomás Kaiser, Ondrej Rucký, Matej Stehlík, Riste Skrekovski. dmtcs, 16(1):143-158, 2014. [doi]

Replication in critical graphs and the persistence of monomial idealsTomás Kaiser, Matej Stehlík, Riste Skrekovski. JCT, 123(1):239-251, 2014. [doi]

2012

Odd Cycle Transversals and Independent Sets in Fullerene GraphsLuerbio Faria, Sulamita Klein, Matej Stehlík. siamdm, 26(3):1458-1469, 2012. [doi]

2011

On the 2-Resonance of FullerenesTomás Kaiser, Matej Stehlík, Riste Skrekovski. siamdm, 25(4):1737-1745, 2011. [doi]

Every Plane Graph of Maximum Degree 8 has an Edge-Face 9-ColoringRoss J. Kang, Jean-Sébastien Sereni, Matej Stehlík. siamdm, 25(2):514-533, 2011. [doi]

Edge-face coloring of plane graphs with maximum degree nineJean-Sébastien Sereni, Matej Stehlík. jgt, 66(4):332-346, 2011. [doi]

2008

Coloring of Triangle-Free Graphs on the Double TorusDaniel Král, Matej Stehlík. siamdm, 22(2):541-553, 2008. [doi]

2007

A hypergraph version of the Gallai-Edmonds TheoremMatej Stehlík. endm, 28:387-391, 2007. [doi]

2006

Minimal Connected ::::tau::::-Critical HypergraphsMatej Stehlík. gc, 22(3):421-426, 2006. [doi]

2004

A generalisation of matching and colouringMatej Stehlík. DM, 285(1-3):257-265, 2004. [doi]

2003

Critical graphs with connected complementsMatej Stehlík. JCT, 89(2):189-194, 2003. [doi]

Sign in or sign up to see more results.

runs on WebDSL