• DML-CZ Home
• Mathematica Bohemica
• Volume 119

Author: Nebeský, Ladislav

• 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