Quasi-median graphs, their generalizations, and tree-like equalities
From MaRDI portal
Publication:1399693
DOI10.1016/S0195-6698(03)00045-3zbMath1022.05070OpenAlexW2035212325MaRDI QIDQ1399693
Boštjan Brešar, Riste Škrekovski, Sandi Klavžar
Publication date: 30 July 2003
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(03)00045-3
Related Items (6)
Characterizing almost-median graphs ⋮ Hamming polynomials and their partial derivatives ⋮ Visualization of quasi-median networks ⋮ On the geodetic number of median graphs ⋮ Retracts of Products of Chordal Graphs ⋮ Cube intersection concepts in median graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dynamic location problem for graphs
- Prefibers and the cartesian product of metric spaces
- Isometric embedding in products of complete graphs
- Isometric embeddings in Hamming graphs
- Invariant Hamming graphs in infinite quasi-median graphs
- The retracts of Hamming graphs
- The structure of median graphs
- A convexity lemma and expansion procedures for bipartite graphs
- Separation of two convex sets in convexity structures
- Retracts of infinite Hamming graphs
- On median graphs and median grid graphs
- Decomposition and \(l_1\)-embedding of weakly median graphs
- An Euler-type formula for median graphs
- Two relations for median graphs
- The cube polynomial and its derivatives: The case of median graphs
- Distance-preserving subgraphs of hypercubes
- On Isometric Embeddings of Graphs
- Product graph representations
- Median Graphs and Triangle-Free Graphs
- Quasi‐median graphs and algebras
- Tiled partial cubes
- Isometric subgraphs of Hamming graphs and d-convexity
- Skeletons, recognition algorithm and distance matrix of quasi-median graphs
- On the Addressing Problem for Loop Switching
- Partial Hamming graphs and expansion procedures
- Recognizing pseudo-median graphs
This page was built for publication: Quasi-median graphs, their generalizations, and tree-like equalities