Guides and shortcuts in graphs

DOI10.1016/j.disc.2012.09.022zbMath1277.05101OpenAlexW2045917768MaRDI QIDQ383749

Henry Martyn Mulder, Ladislav Nebeský

Publication date: 6 December 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.09.022

zbMATH Keywords

cyclespanning treeHamiltonian cyclegeodesic structureguideshortcutsignpost systemstep system

Mathematics Subject Classification ID

Trees (05C05) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Axiomatic characterization of the interval function of a graph
• The induced path convexity, betweenness, and svelte graphs
• Median algebras
• The median function on distributive semilattices
• Intervals and steps in a connected graph
• The algebra of metric betweenness. I: Subdirect representation and retraction
• The algebra of metric betweenness. II: Geometry and equational characterization of weakly median graphs
• Route systems on graphs
• Metric Ternary Distributive Semi-Lattices
• Ternary spaces, media, and Chebyshev sets
• On Properties of a Graph that Depend on its Distance Function
• On signpost systems and connected graphs
• Distance defined by spanning trees in graphs
• Signpost systems and spanning trees of graphs
• Median Algebra
• Geodesics and steps in a connected graph
• Quasi‐median graphs and algebras
• An axiomatic approach to metric properties of connected graphs
• Modular and median signpost systems and their underlying graphs
• Trees, Lattices, Order, and Betweenness
• Medians and Betweenness
• Medians, Lattices, and Trees