Distance-preserving subgraphs of hypercubes
From MaRDI portal
Publication:2555084
Cites work
Cited in
(only showing first 100 items - show all)- A characterization of regular partial cubes whose all convex cycles have the same lengths
- Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes
- Netlike partial cubes. I. General properties
- Convexity in finite metric spaces
- What do trees and hypercubes have in common?
- Tiled partial cubes
- A correction of a characterization of planar partial cubes
- Computing distance moments on graphs with transitive Djoković-Winkler relation
- Isometric subgraphs of Hamming graphs and d-convexity
- Sums of cuts and bipartite metrics
- Cover-preserving embeddings of bipartite orders into Boolean lattices
- Factorization and pseudofactorization of weighted graphs
- Lattice embeddings of trees
- On verifying and engineering the wellgradedness of a union-closed family
- Structure of Fibonacci cubes: a survey
- A mathematical approach on representation of competitions: competition cluster hypergraphs
- Topes of oriented matroids and related structures
- Hypercube embedding of generalized bipartite metrics
- Induced cycles in crossing graphs of median graphs
- Netlike partial cubes, V: completion and netlike classes
- Edge general position sets in Fibonacci and Lucas cubes
- Axiomatic characterization of the interval function of partial cubes and partial Hamming graphs
- Isometric embeddings into cube-hypergraphs
- Convex excess in partial cubes
- On the canonical metric representation, average distance, and partial Hamming graphs
- Not all partial cubes are \(\Theta \)-graceful
- Two-dimensional partial cubes
- On finding convex cuts in general, bipartite and plane graphs
- Embedding of hypercube into fractal cubic network
- The complement of the Djoković-Winkler relation
- A counterexample to Thiagarajan's conjecture on regular event structures
- On the geodetic number of median graphs
- Fixed hypercube embedding
- Interval routing in some planar networks.
- Retracts of infinite Hamming graphs
- Hamiltonian laceability of hypercubes without isometric subgraphs
- Clin d'oeil on L₁-embeddable planar graphs
- Projection of a medium
- Media theory: Representations and examples
- Quasi-median graphs, their generalizations, and tree-like equalities
- An Euler-type formula for median graphs
- A multifacility location problem on median spaces
- On the connectivity of bipartite distance-balanced graphs
- Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes. I: Topologies and the geodesic convexity
- The lattice dimension of a graph
- Partition distance in graphs
- Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements
- Mostar index
- On the immersion of digraphs in cubes
- Fast recognition of classes of almost-median graphs
- On cube-free median graphs
- Characterizing almost-median graphs
- Hamming polynomials and their partial derivatives
- On density of subgraphs of halved cubes
- Unlabeled sample compression schemes for oriented matroids
- On semicube graphs
- Characterizing flag graphs and incuced subgraphs of Cartesian product graphs
- Rhombellane space filling
- A characterization of cube-hypergraphs
- Netlike partial cubes, IV: Fixed finite subgraph theorems
- Netlike partial cubes II. Retracts and netlike subgraphs
- Algorithms for media
- On Isometric Embeddings of Graphs
- Graphs with \(G^p\)-connected medians
- A theorem on Wiener-type invariants for isometric subgraphs of hypercubes
- The edge general position problem
- Medians in median graphs and their cube complexes in linear time
- Lattice Points of Cut Cones
- Intersection graphs of maximal hypercubes
- Partial cubes and Archimedean tilings
- Representations of graphs and networks (coding, layouts and embeddings)
- Distance-based topological indices of nanosheets, nanotubes and nanotori of SiO\(_2\)
- Moore graphs and cycles are extremal graphs for convex cycles
- The Szeged index and the Wiener index of partial cubes with applications to chemical graphs
- On some properties of antipodal partial cubes
- On partial cubes, well-graded families and their duals with some applications in graphs
- Fast recognition algorithms for classes of partial cubes
- On the natural imprint function of a graph
- An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength
- Cubes polynomial and its derivatives
- Topological indices of the subdivision of a family of partial cubes and computation of \(\mathrm{SiO}_2\) related structures
- A note on Winkler's algorithm for factoring a connected graph
- Computing equivalence classes among the edges of a graph with applications
- Mirror graphs: graph theoretical characterization of reflection arrangements and finite Coxeter groups
- Graphene Derivatives: Carbon Nanocones and CorSu Lattice: A Topological Approach
- On bipartite graphs whose interval space is a closed join space
- Betweenness in graphs: a short survey on shortest and induced path betweenness
- The number of edges in a subgraph of a Hamming graph
- Labeled sample compression schemes for complexes of oriented matroids
- Hypercellular graphs: partial cubes without \(Q_3^-\) as partial cube minor
- A relation between the cube polynomials of partial cubes and the clique polynomials of their crossing graphs
- Supremal \(p\)-negative type of vertex transitive graphs
- A negative answer to a problem on generalized Fibonacci cubes
- Isometric embedding of subdivided Connected graphs in the hypercube
- Cage-amalgamation graphs, a common generalization of chordal and median graphs
- Isometric embeddings of subdivided complete graphs in the hypercube
- \(L_ 1\)-embeddability of rectilinear polygons with holes
- Isometric Diamond Subgraphs
- Isometric Hamming embeddings of weighted graphs
- A characterization of hypercubes
This page was built for publication: Distance-preserving subgraphs of hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2555084)