Tiled partial cubes
From MaRDI portal
Publication:4539873
DOI10.1002/JGT.10031zbMATH Open0997.05030OpenAlexW4240712083MaRDI QIDQ4539873FDOQ4539873
Authors: Boštjan Brešar, Wilfried Imrich, Sandi Klavžar, Henry Martyn Mulder, Riste Škrekovski 
Publication date: 11 July 2002
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10031
Recommendations
Cites Work
- On the Addressing Problem for Loop Switching
- Graphs of some CAT(0) complexes
- n‐cubes and median graphs
- Isometric embedding in products of complete graphs
- Distance-preserving subgraphs of hypercubes
- Isometric embeddings in Hamming graphs
- Quasi‐median graphs and algebras
- Recognizing binary Hamming graphs inO(n 2 logn) time
- Median Graphs and Triangle-Free Graphs
- Networks with Condorcet solutions
- Decomposition and \(l_1\)-embedding of weakly median graphs
- Median graphs, parallelism and posets
- The structure of median graphs
- A convexity lemma and expansion procedures for bipartite graphs
- Isometric subgraphs of Hamming graphs and d-convexity
- An Euler-type formula for median graphs
- Partial Hamming graphs and expansion procedures
Cited In (10)
- Fast recognition algorithms for classes of partial cubes
- A characterization of planar partial cubes
- Resonance graphs on perfect matchings of graphs on surfaces
- Asymptotic number of isometric generalized Fibonacci cubes
- A characterization of regular partial cubes whose all convex cycles have the same lengths
- Convex excess in partial cubes
- Quasi-median graphs, their generalizations, and tree-like equalities
- Characterizing almost-median graphs. II.
- Characterizing almost-median graphs
- Partial cubes and Archimedean tilings
This page was built for publication: Tiled partial cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4539873)
