scientific article
From MaRDI portal
Publication:2713706
zbMath0963.05032MaRDI QIDQ2713706
Publication date: 10 June 2001
Full work available at URL: https://eudml.org/doc/226136
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Structural characterization of families of graphs (05C75) Sets with a single binary operation (groupoids) (20N02)
Related Items (12)
Intervals and steps in a connected graph ⋮ A construction of smooth travel groupoids on finite graphs ⋮ Unnamed Item ⋮ A monoid structure on the set of all binary operations over a fixed set ⋮ Guides and shortcuts in graphs ⋮ The Non-confusing Travel Groupoids on a Finite Connected Graph ⋮ Characterizations of the simple non-confusing travel groupoids on a finite graph ⋮ Travel groupoids ⋮ Signpost systems and spanning trees of graphs ⋮ On Properties of a Graph that Depend on its Distance Function ⋮ Travel groupoids on infinite graphs ⋮ New proof of a characterization of geodetic graphs
This page was built for publication:
