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

Article

Changat, Manoj ; Mulder, Henry Martyn
Route systems on graphs. (English). Mathematica Bohemica, vol. 126 (2001), issue 3, pp. 607-612
MSC: 05C12, 05C38 | MR 1970263 | Zbl 0977.05069 | DOI: 10.21136/MB.2001.134203
Keywords:
trail; route system; path
Summary:
The well known types of routes in graphs and directed graphs, such as walks, trails, paths, and induced paths, are characterized using axioms on vertex sequences. Thus non-graphic characterizations of the various types of routes are obtained.
References:
[1] L. Nebeský: Route systems and bipartite graphs. Czechoslovak Math. J. 41 (1991), 260–264. MR 1105440
[2] L. Nebeský: Route systems of a connected graph. Math. Bohem. 119 (1994), 407–414. MR 1316593
[3] L. Nebeský: Characterization of the set of all shortest paths in a connected graph. Math. Bohem. 119 (1994), 15–20. MR 1303548
Partner of
EuDML logo