Quasi-median graphs, their generalizations, and tree-like equalities

DOI10.1016/S0195-6698(03)00045-3MaRDI QIDQ1399693zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

quasi-median graphpartial Hamming graphEuler-type formulaquasi-semimedian graphtree-like equality

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Structural characterization of families of graphs (05C75)

Recommendations

• Quasi-almostmedian graphs
• Publication:4865631
• Two relations for median graphs
• Quasi‐median graphs and algebras
• Median and quasi-median direct products of graphs

Cites work

• scientific article; zbMATH DE number 4049076 (Why is no real title available?)
• scientific article; zbMATH DE number 3697163 (Why is no real title available?)
• scientific article; zbMATH DE number 15874 (Why is no real title available?)
• scientific article; zbMATH DE number 26592 (Why is no real title available?)
• scientific article; zbMATH DE number 1339499 (Why is no real title available?)
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• A convexity lemma and expansion procedures for bipartite graphs
• A dynamic location problem for graphs
• An Euler-type formula for median graphs
• Decomposition and \(l_1\)-embedding of weakly median graphs
• Distance-preserving subgraphs of hypercubes
• Invariant Hamming graphs in infinite quasi-median graphs
• Isometric embedding in products of complete graphs
• Isometric embeddings in Hamming graphs
• Isometric subgraphs of Hamming graphs and d-convexity
• Median Graphs and Triangle-Free Graphs
• On Isometric Embeddings of Graphs
• On median graphs and median grid graphs
• On the Addressing Problem for Loop Switching
• Partial Hamming graphs and expansion procedures
• Prefibers and the cartesian product of metric spaces
• Product graph representations
• Quasi‐median graphs and algebras
• Recognizing pseudo-median graphs
• Retracts of infinite Hamming graphs
• Separation of two convex sets in convexity structures
• Skeletons, recognition algorithm and distance matrix of quasi-median graphs
• The cube polynomial and its derivatives: The case of median graphs
• The retracts of Hamming graphs
• The structure of median graphs
• Tiled partial cubes
• Two relations for median graphs

Cited in

(9)

• Visualization of quasi-median networks
• Characterizing almost-median graphs
• Hamming polynomials and their partial derivatives
• On the geodetic number of median graphs
• Retracts of products of chordal graphs
• Arboreal structure and regular graphs of median-like classes
• Quasi‐median graphs and algebras
• Cube intersection concepts in median graphs
• Computing the blocks of a quasi-median graph

This page was built for publication: Quasi-median graphs, their generalizations, and tree-like equalities

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