Geodesic
Route systems on graphs
Mathematica Bohemica, Tome 126 (2001) no. 3, pp. 607-612

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

MR Zbl
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.
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.
DOI : 10.21136/MB.2001.134203
Classification : 05C12, 05C38
Keywords: trail; route system; path 
Changat, Manoj; Mulder, Henry Martyn. Route systems on graphs. Mathematica Bohemica, Tome 126 (2001) no. 3, pp. 607-612. doi: 10.21136/MB.2001.134203
@article{10_21136_MB_2001_134203,
     author = {Changat, Manoj and Mulder, Henry Martyn},
     title = {Route systems on graphs},
     journal = {Mathematica Bohemica},
     pages = {607--612},
     year = {2001},
     volume = {126},
     number = {3},
     doi = {10.21136/MB.2001.134203},
     mrnumber = {1970263},
     zbl = {0977.05069},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.2001.134203/}
}
TY  - JOUR
AU  - Changat, Manoj
AU  - Mulder, Henry Martyn
TI  - Route systems on graphs
JO  - Mathematica Bohemica
PY  - 2001
SP  - 607
EP  - 612
VL  - 126
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/MB.2001.134203/
DO  - 10.21136/MB.2001.134203
LA  - en
ID  - 10_21136_MB_2001_134203
ER  - 
%0 Journal Article
%A Changat, Manoj
%A Mulder, Henry Martyn
%T Route systems on graphs
%J Mathematica Bohemica
%D 2001
%P 607-612
%V 126
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/MB.2001.134203/
%R 10.21136/MB.2001.134203
%G en
%F 10_21136_MB_2001_134203

[1] L. Nebeský: Route systems and bipartite graphs. Czechoslovak Math. J. 41 (1991), 260–264. | MR

[2] L. Nebeský: Route systems of a connected graph. Math. Bohem. 119 (1994), 407–414. | MR

[3] L. Nebeský: Characterization of the set of all shortest paths in a connected graph. Math. Bohem. 119 (1994), 15–20. | MR

Cité par Sources :