Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Stehl{\'{i}}k, Mat{\v{e}}j"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Replication in critical graphs and the persistence of monomial ideals
Tomás̑ Kaiser
,
Matȇj Stehlík
,
Riste S̑krekovski
Journal of Combinatorial Theory Series A
123
, 2014, pp. 239-251
Odd cycle transversals and independent sets in fullerene graphs
Luerbio Faria
,
Sulamita Klein
,
Matȇj Stehlík
SIAM Journal on Discrete Mathematics
26
(3), 2012, pp. 1458-1469
On the 2-resonance of fullerenes
Tomás̑ Kaiser
,
Matȇj Stehlík
,
Riste S̑krekovski
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1737-1745
Every plane graph of maximum degree 8 has an edge-face 9-coloring
Ross J. Kang
,
Jean-Sébastien Sereni
,
Matȇj Stehlík
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 514-533
Edge-face coloring of plane graphs with maximum degree nine
Jean-Sébastien Sereni
,
Matȇj Stehlík
Journal of Graph Theory
66
(4), 2011, pp. 332-346
Coloring of triangle-free graphs on the double torus
Daniel Král'
,
Matȇj Stehlík
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 541-553
Minimal connected
\tau
-critical hypergraphs
Matȇj Stehlík
Graphs and Combinatorics
22
(3), 2006, pp. 421-426