Route systems of a connected graph

Nebeský, Ladislav. "Route systems of a connected graph." Mathematica Bohemica 119.4 (1994): 407-414. <http://eudml.org/doc/29268>.

@article{Nebeský1994,
abstract = {The concept of a route system was introduced by the present author in [3].Route systems of a connected graph $G$ generalize the set of all shortest paths in $G$. In this paper some properties of route systems are studied.},
author = {Nebeský, Ladislav},
journal = {Mathematica Bohemica},
keywords = {connected graph; geodetic graph; bipartite graph; route system; shortest paths; connected graph; geodetic graph; bipartite graph; route system; shortest paths},
language = {eng},
number = {4},
pages = {407-414},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Route systems of a connected graph},
url = {http://eudml.org/doc/29268},
volume = {119},
year = {1994},
}

TY - JOUR
AU - Nebeský, Ladislav
TI - Route systems of a connected graph
JO - Mathematica Bohemica
PY - 1994
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 119
IS - 4
SP - 407
EP - 414
AB - The concept of a route system was introduced by the present author in [3].Route systems of a connected graph $G$ generalize the set of all shortest paths in $G$. In this paper some properties of route systems are studied.
LA - eng
KW - connected graph; geodetic graph; bipartite graph; route system; shortest paths; connected graph; geodetic graph; bipartite graph; route system; shortest paths
UR - http://eudml.org/doc/29268
ER -