Route systems on graphs
Manoj Changat; Henry Martyn Mulder
Mathematica Bohemica (2001)
- Volume: 126, Issue: 3, page 607-612
- ISSN: 0862-7959
Access Full Article
topAbstract
topHow to cite
topChangat, Manoj, and Mulder, Henry Martyn. "Route systems on graphs." Mathematica Bohemica 126.3 (2001): 607-612. <http://eudml.org/doc/248873>.
@article{Changat2001,
abstract = {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.},
author = {Changat, Manoj, Mulder, Henry Martyn},
journal = {Mathematica Bohemica},
keywords = {trail; route system; path; path; trail; route system},
language = {eng},
number = {3},
pages = {607-612},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Route systems on graphs},
url = {http://eudml.org/doc/248873},
volume = {126},
year = {2001},
}
TY - JOUR
AU - Changat, Manoj
AU - Mulder, Henry Martyn
TI - Route systems on graphs
JO - Mathematica Bohemica
PY - 2001
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 126
IS - 3
SP - 607
EP - 612
AB - 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.
LA - eng
KW - trail; route system; path; path; trail; route system
UR - http://eudml.org/doc/248873
ER -
References
top- Route systems and bipartite graphs, Czechoslovak Math. J. 41 (1991), 260–264. (1991) MR1105440
- Route systems of a connected graph, Math. Bohem. 119 (1994), 407–414. (1994) MR1316593
- Characterization of the set of all shortest paths in a connected graph, Math. Bohem. 119 (1994), 15–20. (1994) MR1303548
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.