Convex excess in partial cubes
From MaRDI portal
Publication:2891047
DOI10.1002/jgt.20589zbMath1243.05179OpenAlexW1919011144MaRDI QIDQ2891047
Sandi Klavžar, Sergey V. Shpectorov
Publication date: 13 June 2012
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20589
Hypergraphs (05C65) Distance in graphs (05C12) Combinatorial aspects of tessellation and tiling problems (05B45)
Related Items (10)
There are no finite partial cubes of girth more than 6 and minimum degree at least 3 ⋮ Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles ⋮ On partial cubes, well-graded families and their duals with some applications in graphs ⋮ Convexity in partial cubes: the hull number ⋮ Corners and simpliciality in oriented matroids and partial cubes ⋮ Efficient realizations of closure systems ⋮ Characterizing almost-median graphs. II. ⋮ On tope graphs of complexes of oriented matroids ⋮ Hypercellular graphs: partial cubes without \(Q_3^-\) as partial cube minor ⋮ Two-dimensional partial cubes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Antipodal graphs and oriented matroids
- Isometric embedding in products of complete graphs
- Cubic partial cubes from simplicial arrangements
- Partial cubes and their \(\tau\)-graphs
- A characterization of planar partial cubes
- Partial cubes: Structures, characterizations, and constructions
- Netlike partial cubes, IV: Fixed finite subgraph theorems
- Netlike partial cubes, V: completion and netlike classes
- Isometric embeddings of subdivided connected graphs into hypercubes
- The structure of median graphs
- A convexity lemma and expansion procedures for bipartite graphs
- An Euler-type formula for median graphs
- The lattice dimension of a graph
- Two relations for median graphs
- Cellular bipartite graphs
- Embeddability of open-ended carbon nanotubes in hypercubes
- Netlike partial cubes. I. General properties
- Partial cubes are distance graphs
- Combinatorics of lopsided sets
- On semicube graphs
- Distance-preserving subgraphs of hypercubes
- Graphs \(4_n\) that are isometrically embeddable in hypercubes
- Metric Ternary Distributive Semi-Lattices
- Isometric Embeddings of Subdivided Complete Graphs in the Hypercube
- Distance and routing labeling schemes for non-positively curved plane graphs
- Tiled partial cubes
- Oriented Matroids
- Isometric subgraphs of Hamming graphs and d-convexity
- Crossing Graphs as Joins of Graphs and Cartesian Products of Median Graphs
- On the Addressing Problem for Loop Switching
- Geometry of cuts and metrics
This page was built for publication: Convex excess in partial cubes