Either tournaments or algebras? - Vladimír Müller; Jaroslav Nesetril; Jan Pelant (Discret. Math., 1975)

The edge reconstruction hypothesis is true for graphs with more than n · log2n edges. - Vladimír Müller (J. Comb. Theory B, 1977)

The number of Hamiltonian circuits. - Vladimír Müller; Jan Pelant (J. Comb. Theory B, 1978)

On colorings of graphs without short cycles. - Vladimír Müller (Discret. Math., 1979)

Monotone paths in ordered graphs. - Vladimír Müller; Vojtech Rödl (Comb., 1982)

On Embedding Interconnection Networks into Rings of Processors. - Juraj Hromkovic; Vladimír Müller; Ondrej Sýkora; Imrich Vrto (PARLE, 1992)

Embedding of a separable locally pseudoconvex algebra into a locally pseudoconvex algebra with two generators. - Antonio Fernández 004; Vladimír Müller (Discret. Math., 1992)

On Embeddings in Cycles - Juraj Hromkovic; Vladimír Müller; Ondrej Sýkora; Imrich Vrto (Inf. Comput., 1995)

On the universality of multipliers on H(C). - José A. Conejero; Vladimír Müller (J. Approx. Theory, 2010)

Joint numerical ranges and compressions of powers of operators. - Vladimír Müller; Yuri Tomilov (J. Lond. Math. Soc., 2019)