Netlike partial cubes, V: completion and netlike classes
From MaRDI portal
Publication:1043960
DOI10.1016/J.DISC.2009.01.019zbMATH Open1209.05202OpenAlexW1972683033MaRDI QIDQ1043960FDOQ1043960
Publication date: 10 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.01.019
hypercubegeodesic convexitypartial cubemedian graphcompletiongated setcellular bipartite graphnetlike partial cubemedian cycle propertynetlike class
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A canonical decomposition theory for metrics on a finite set
- Netlike partial cubes. I. General properties
- Isometric embedding in products of complete graphs
- Distance-preserving subgraphs of hypercubes
- The median procedure on median graphs
- Gated sets in metric spaces
- The structure of median graphs
- The lattice dimension of a graph
- Netlike partial cubes, IV: Fixed finite subgraph theorems
- Netlike partial cubes II. Retracts and netlike subgraphs
- A convexity lemma and expansion procedures for bipartite graphs
- Isometric subgraphs of Hamming graphs and d-convexity
- On compact median graphs
- Partial cubes and crossing graphs
- Separation of two convex sets in convexity structures
- Cellular bipartite graphs
- Partial cubes and their \(\tau\)-graphs
- Superextensions and the depth of median graphs
- Netlike partial cubes III. The median cycle property
- On Tetha-graphs of partial cubes
Cited In (3)
This page was built for publication: Netlike partial cubes, V: completion and netlike classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1043960)
