• DML-CZ Home

Author: Horák, Peter

• Horák, Peter: A note on removing a point of a strong digraph. (English). Mathematica Slovaca, vol. 33 (1983), issue 1, pp. 85-86
• Horák, Peter: Digraphs maximal with respect to arc connectivity. (English). Mathematica Slovaca, vol. 32 (1982), issue 3, pp. 243-253
• Horák, Peter: Enumeration of graphs maximal with respect to connectivity. (English). Mathematica Slovaca, vol. 32 (1982), issue 1, pp. 81-84
• Horák, Peter: Generalized uniformly line vulnerable digraphs. (English). Časopis pro pěstování matematiky, vol. 107 (1982), issue 4, pp. 407-411
• Horák, Peter: Digraphs maximal with respect to connectivity. (English). Mathematica Slovaca, vol. 29 (1979), issue 1, pp. 87-90
• Horák, Peter; Továrek, Leoš: On Hamiltonian cycles of complete $n$-partite graphs. (English). Mathematica Slovaca, vol. 29 (1979), issue 1, pp. 43-47