Author: Nebeský, Ladislav

Nebeský, Ladislav: Hamiltonian colorings of graphs with long cycles. (English). Mathematica Bohemica, vol. 128 (2003), issue 3, pp. 263-275
Nebeský, Ladislav: The induced paths in a connected graph and a ternary relation determined by them. (English). Mathematica Bohemica, vol. 127 (2002), issue 3, pp. 397-408
Nebeský, Ladislav: The interval function of a connected graph and a characterization of geodetic graphs. (English). Mathematica Bohemica, vol. 126 (2001), issue 1, pp. 247-254
Nebeský, Ladislav: A tree as a finite nonempty set with a binary operation. (English). Mathematica Bohemica, vol. 125 (2000), issue 4, pp. 455-458
Nebeský, Ladislav: Characterizing the interval function of a connected graph. (English). Mathematica Bohemica, vol. 123 (1998), issue 2, pp. 137-144
Nebeský, Ladislav: A characterization of the set of all shortest paths in a connected graph. (English). Mathematica Bohemica, vol. 119 (1994), issue 1, pp. 15-20
Nebeský, Ladislav: Route systems of a connected graph. (English). Mathematica Bohemica, vol. 119 (1994), issue 4, pp. 407-414
Nebeský, Ladislav: A matching and a Hamiltonian cycle of the fourth power of a connected graph. (English). Mathematica Bohemica, vol. 118 (1993), issue 1, pp. 43-52

Partner of