There are no finite partial cubes of girth more than 6 and minimum degree at least 3
From MaRDI portal
Publication:268262
DOI10.1016/j.ejc.2016.01.005zbMath1333.05205arXiv1503.04706OpenAlexW2276257166MaRDI QIDQ268262
Publication date: 14 April 2016
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.04706
Related Items
On some properties of antipodal partial cubes, COMs: complexes of oriented matroids, On some characterizations of antipodal partial cubes, On tope graphs of complexes of oriented matroids, On antipodal and diametrical partial cubes, Daisy cubes and distance cube polynomial, Characterization of 2-arc-transitive partial cubes, Mirror graphs: graph theoretical characterization of reflection arrangements and finite Coxeter groups
Cites Work
- Vertex-transitive median graphs of non-exponential growth
- Distance regular subgraphs of a cube
- Antipodal graphs and oriented matroids
- A poset-based approach to embedding median graphs in hypercubes and lattices
- Isometric embedding in products of complete graphs
- Cubic partial cubes from simplicial arrangements
- Covering partial cubes with zones
- Convexity in partial cubes: the hull number
- Partial cubes: Structures, characterizations, and constructions
- Transitive, locally finite median graphs with finite blocks
- Cubic inflation, mirror graphs, regular maps, and partial cubes
- Regular median graphs of linear growth
- Tree-like partial Hamming graphs
- Netlike partial cubes. I. General properties
- Convex excess in partial cubes
- Infinite median graphs, (0, 2)-graphs, and hypercubes
- Retracts of hypercubes
- n‐cubes and median graphs
- Oriented Matroids
- On the Addressing Problem for Loop Switching
- Geometry of cuts and metrics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
