Partial cubes and their \(\tau\)-graphs
From MaRDI portal
Publication:875040
DOI10.1016/j.ejc.2006.04.006zbMath1120.05027MaRDI QIDQ875040
Publication date: 10 April 2007
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2006.04.006
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C12: Distance in graphs
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
Polyhexes that are \(\ell _1\) graphs, Netlike partial cubes, V: completion and netlike classes, Induced cycles in crossing graphs of median graphs, On semicube graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Isometric embedding in products of complete graphs
- On the use of ordered sets in problems of comparison and consensus of classifications
- A convexity lemma and expansion procedures for bipartite graphs
- The lattice dimension of a graph
- Graphs of acyclic cubical complexes
- Distance-preserving subgraphs of hypercubes
- Partial Cubes and Crossing Graphs
- Product graph representations
- Factoring cartesian‐product graphs
- Isometric subgraphs of Hamming graphs and d-convexity
- Embedding Topological Median Algebras in Products of Dendrons
- Geometry of cuts and metrics