Skeletons, recognition algorithm and distance matrix of quasi-median graphs

DOI10.1080/00207169508804371zbMath0845.68055OpenAlexW2047904296WikidataQ126245698 ScholiaQ126245698MaRDI QIDQ4847142

Johann Hagauer

Publication date: 15 September 1996

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169508804371

zbMATH Keywords

quasi-median graphweak retract\(s\)-skeleton

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (6)

Axiomatic characterization of the median function of a block graph ⋮ Clique-gated graphs ⋮ Retracts of infinite Hamming graphs ⋮ Quasi-median graphs, their generalizations, and tree-like equalities ⋮ The median function of a block graph: axiomatic characterizations ⋮ Recognizing pseudo-median graphs

Cites Work

• Unnamed Item
• A dynamic location problem for graphs
• Gated sets in metric spaces
• The retracts of Hamming graphs
• The structure of median graphs
• An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
• Retracts of hypercubes
• Product graph representations

This page was built for publication: Skeletons, recognition algorithm and distance matrix of quasi-median graphs