| Title:
|
Route systems on graphs (English) |
| Author:
|
Changat, Manoj |
| Author:
|
Mulder, Henry Martyn |
| Language:
|
English |
| Journal:
|
Mathematica Bohemica |
| ISSN:
|
0862-7959 (print) |
| ISSN:
|
2464-7136 (online) |
| Volume:
|
126 |
| Issue:
|
3 |
| Year:
|
2001 |
| Pages:
|
607-612 |
| Summary lang:
|
English |
| . |
| Category:
|
math |
| . |
| 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. (English) |
| Keyword:
|
trail |
| Keyword:
|
route system |
| Keyword:
|
path |
| MSC:
|
05C12 |
| MSC:
|
05C38 |
| idZBL:
|
Zbl 0977.05069 |
| idMR:
|
MR1970263 |
| DOI:
|
10.21136/MB.2001.134203 |
| . |
| Date available:
|
2009-09-24T21:54:52Z |
| Last updated:
|
2020-07-29 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/134203 |
| . |
| Reference:
|
[1] L. Nebeský: Route systems and bipartite graphs.Czechoslovak Math. J. 41 (1991), 260–264. MR 1105440 |
| Reference:
|
[2] L. Nebeský: Route systems of a connected graph.Math. Bohem. 119 (1994), 407–414. MR 1316593 |
| Reference:
|
[3] L. Nebeský: Characterization of the set of all shortest paths in a connected graph.Math. Bohem. 119 (1994), 15–20. MR 1303548 |
| . |
