On signpost systems and connected graphs
From MaRDI portal
Publication:3366716
DOI10.1007/S10587-005-0022-0zbMATH Open1081.05054OpenAlexW2126896920MaRDI QIDQ3366716FDOQ3366716
Authors: Ladislav Nebeský
Publication date: 14 February 2006
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/30945
Recommendations
Cites Work
- Title not available (Why is that?)
- On Properties of a Graph that Depend on its Distance Function
- Geodesics and steps in a connected graph
- An axiomatic approach to metric properties of connected graphs
- Modular and median signpost systems and their underlying graphs
- A theorem for an axiomatic approach to metric properties of graphs
Cited In (9)
- Travel groupoids
- Distance-hereditary graphs and signpost systems
- A new approach to chordal graphs
- Signpost systems and spanning trees of graphs
- Travel groupoids on infinite graphs.
- Modular and median signpost systems and their underlying graphs
- Title not available (Why is that?)
- Guides and shortcuts in graphs
- The Non-confusing Travel Groupoids on a Finite Connected Graph
This page was built for publication: On signpost systems and connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3366716)