Full entry |
PDF
(0.2 MB)
Feedback

signpost system; path; connected graph; tree; spanning tree

References:

[1] G. Chartrand, L. Lesniak: **Graphs & Digraphs. Third edition**. Chapman & Hall, London, 1996. MR 1408678

[2] H. M. Mulder, L. Nebeský: **Modular and median signpost systems and their underlying graphs**. Discussiones Mathematicae Graph Theory 23 (2003), 309–324. DOI 10.7151/dmgt.1204 | MR 2070159

[3] L. Nebeský: **Geodesics and steps in a connected graph**. Czechoslovak Math. J. 47(122) (1997), 149–161. DOI 10.1023/A:1022404624515 | MR 1435613

[4] L. Nebeský: **An axiomatic approach to metric properties of connected graphs**. Czechoslovak Math. J. 50(125) (2000), 3–14. DOI 10.1023/A:1022472700080 | MR 1745453

[5] L. Nebeský: **A tree as a finite nonempty set with a binary operation**. Mathematica Bohemica 125 (2000), 455–458. MR 1802293

[6] L. Nebeský: **On properties of a graph that depend on its distance function**. Czechoslovak Math. J. 54(129) (2004), 445–456. DOI 10.1023/B:CMAJ.0000042383.98585.97 | MR 2059265

[7] L. Nebeský: **Signpost systems and connected graphs**. Czechoslovak Math. J. 55(130) (2005), 283–293. DOI 10.1007/s10587-005-0022-0 | MR 2137138