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

DOI10.1080/00207169508804371zbMATH Open0845.68055OpenAlexW2047904296WikidataQ126245698 ScholiaQ126245698MaRDI QIDQ4847142FDOQ4847142

Authors: 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

Recommendations

• Recognizing median graphs in subquadratic time
• Median and quasi-median direct products of graphs
• Quasi-almostmedian graphs
• Computing the blocks of a quasi-median graph
• Quasi‐median graphs and algebras

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)

Cites Work

• Retracts of hypercubes
• The retracts of Hamming graphs
• Title not available (Why is that?)
• A dynamic location problem for graphs
• An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
• Product graph representations
• Gated sets in metric spaces
• The structure of median graphs

Cited In (6)

• Clique-gated graphs
• Axiomatic characterization of the median function of a block graph
• 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

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

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