An Euler-type formula for median graphs
From MaRDI portal
Publication:1584314
Recommendations
Cites work
- Distance-preserving subgraphs of hypercubes
- 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 653263 (Why is no real title available?)
- Isometric embedding in products of complete graphs
- On Isometric Embeddings of Graphs
- The structure of median graphs
Cited in
(10)- Cube intersection concepts in median graphs
- Quasi-median graphs, their generalizations, and tree-like equalities
- Counting vertices and cubes in median graphs of circular split systems
- Planar median graphs and cubesquare-graphs
- Convex excess in partial cubes
- Tiled partial cubes
- Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
- Cube-free resonance graphs
- On cube-free median graphs
- Hamming polynomials and their partial derivatives
This page was built for publication: An Euler-type formula for median graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584314)