An Euler-type formula for median graphs

DOI10.1016/S0012-365X(98)00019-3zbMath0957.05031WikidataQ60962154 ScholiaQ60962154MaRDI QIDQ1584314

Sandi Klavžar, Riste Škrekovski, Henry Martyn Mulder

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

median graph

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (10)

Convex excess in partial cubes ⋮ Tiled partial cubes ⋮ On cube-free median graphs ⋮ Hamming polynomials and their partial derivatives ⋮ 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 ⋮ Counting vertices and cubes in median graphs of circular split systems ⋮ Cube intersection concepts in median graphs ⋮ Cube-free resonance graphs

Cites Work

• Isometric embedding in products of complete graphs
• The structure of median graphs
• Distance-preserving subgraphs of hypercubes
• On Isometric Embeddings of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Euler-type formula for median graphs