Median Graphs and Triangle-Free Graphs
From MaRDI portal
Publication:4255811
DOI10.1137/S0895480197323494zbMath0916.68106OpenAlexW2074820158WikidataQ60962153 ScholiaQ60962153MaRDI QIDQ4255811
Wilfried Imrich, Sandi Klavžar, Henry Martyn Mulder
Publication date: 27 June 1999
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480197323494
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)
Related Items (max. 100)
An ABC-problem for location and consensus functions on graphs ⋮ Tiled partial cubes ⋮ Competition hypergraphs of products of digraphs ⋮ Computing median and antimedian sets in median graphs ⋮ On cube-free median graphs ⋮ Maximal proper subgraphs of median graphs ⋮ Covering partial cubes with zones ⋮ Quasi-median graphs, their generalizations, and tree-like equalities ⋮ Subquadratic-time algorithm for the diameter and all eccentricities on median graphs ⋮ Planar median graphs and cubesquare-graphs ⋮ Fast recognition algorithms for classes of partial cubes ⋮ Ramified rectilinear polygons: coordinatization by dendrons ⋮ Structure of Fibonacci cubes: a survey ⋮ On the remoteness function in median graphs ⋮ Cube intersection concepts in median graphs ⋮ What Do Trees and Hypercubes Have in Common? ⋮ Five axioms for location functions on median graphs
This page was built for publication: Median Graphs and Triangle-Free Graphs