About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us

Previous | Up | Next

Author: Nebeský, Ladislav

Nebeský, Ladislav: On the set of all shortest paths of a given length in a connected graph. (English). Czechoslovak Mathematical Journal, vol. 46 (1996), issue 1, pp. 155-160

Browse
- Collections
- Titles
- Authors
- MSC

Partner of