Previous |  Up |  Next

Article

Keywords:
travel groupoid; graph; path; geodetic graph
Summary:

References:
[1] G.  Chartrand, L.  Lesniak: Graphs & Digraphs. Third edition. Chapman & Hall, London, 1996. MR 1408678
[2] L.  Nebeský: An algebraic characterization of geodetic graphs. Czechoslovak Math.  J. 48(123) (1998), 701–710. MR 1658245
[3] L.  Nebeský: A tree as a finite nonempty set with a binary operation. Math. Bohem. 125 (2000), 455–458. MR 1802293
[4] L.  Nebeský: New proof of a characterization of geodetic graphs. Czechoslovak Math.  J. 52(127) (2002), 33–39. MR 1885455 | Zbl 0995.05124
[5] L.  Nebeský: On signpost systems and connected graphs. Czechoslovak Math.  J. 55(130) (2005), 283–293. MR 2137138 | Zbl 1081.05054
Partner of
EuDML logo