Signpost systems and spanning trees of graphs

DOI10.1007/S10587-006-0063-ZMaRDI QIDQ3599915zbMATH OpenOpenAlexFDO

Authors Ladislav Nebeský

Publication date 9 February 2009

Published in Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/31074, http://hdl.handle.net/10338.dmlcz/128113

zbMATH Keywords

treeconnected graphspanning treepath

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Paths and cycles (05C38) Graph theory (05C99)

Recommendations

• On signpost systems and connected graphs
• Guides and shortcuts in graphs
• Distance-hereditary graphs and signpost systems
• Modular and median signpost systems and their underlying graphs
• Independent trees in graphs

Cites work

• A tree as a finite nonempty set with a binary operation
• An axiomatic approach to metric properties of connected graphs
• Geodesics and steps in a connected graph
• Modular and median signpost systems and their underlying graphs
• On Properties of a Graph that Depend on its Distance Function
• On signpost systems and connected graphs

Cited in

(4)

• Distance-hereditary graphs and signpost systems
• On signpost systems and connected graphs
• Modular and median signpost systems and their underlying graphs
• Guides and shortcuts in graphs

This page was built for publication: Signpost systems and spanning trees of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599915)