Distance-preserving subgraphs of hypercubes
From MaRDI portal
Publication:2555084
Cites work
Cited in
(only showing first 100 items - show all)- Subdivided graphs as isometric subgraphs of Hamming graphs
- Cage-amalgamation graphs, a common generalization of chordal and median graphs
- Lattice embeddings of trees
- Netlike partial cubes, IV: Fixed finite subgraph theorems
- On the geodesic pre-hull number of a graph
- Netlike partial cubes II. Retracts and netlike subgraphs
- Netlike partial cubes III. The median cycle property
- On verifying and engineering the wellgradedness of a union-closed family
- Netlike partial cubes, V: completion and netlike classes
- Isometric embeddings of subdivided connected graphs into hypercubes
- Induced cycles in crossing graphs of median graphs
- Collapse of the metric hierarchy for bipartite graphs
- Fixed hypercube embedding
- Isometric embeddings in Hamming graphs
- On the complexity of testing a graph for n-cube
- A graph theoretic approach to switching function minimization
- Representations of graphs and networks (coding, layouts and embeddings)
- The retracts of Hamming graphs
- Cover-preserving order embeddings into Boolean lattices
- On the immersion of digraphs in cubes
- On cubical graphs
- A characterization of hypercubes
- Boolean layer cakes
- \(\ell_ 1\)-rigid graphs
- Separation of two convex sets in convexity structures
- Convexity in finite metric spaces
- Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements
- Isometric embeddings into cube-hypergraphs
- On the natural imprint function of a graph
- Characterization of products of trees and grids
- Clin d'oeil on L₁-embeddable planar graphs
- Wiener number of vertex-weighted graphs and a chemical application
- Retracts of infinite Hamming graphs
- Cover-preserving embeddings of bipartite orders into Boolean lattices
- Quasi-median graphs, their generalizations, and tree-like equalities
- Interval routing in some planar networks.
- Isometric embeddings of subdivided wheels in hypercubes
- Fast recognition algorithms for classes of partial cubes
- Cubic inflation, mirror graphs, regular maps, and partial cubes
- Decomposition and \(l_1\)-embedding of weakly median graphs
- An Euler-type formula for median graphs
- Fullerenes and coordination polyhedra versus half-cube embeddings
- The number of edges in a subgraph of a Hamming graph
- Partial cubes and Archimedean tilings
- On the difference between the (revised) Szeged index and the Wiener index of cacti
- Partition distance in graphs
- Mostar index
- Distance-based topological indices of nanosheets, nanotubes and nanotori of SiO\(_2\)
- On some characterizations of antipodal partial cubes
- The Szeged index and the Wiener index of partial cubes with applications to chemical graphs
- Distance-preserving subgraphs of Johnson graphs
- On simplicial and cubical complexes with short links
- The lattice dimension of a graph
- On the complexity of the embedding problem for hypercube related graphs
- Sums of cuts and bipartite metrics
- Hypercube embedding of generalized bipartite metrics
- Intersection graphs of maximal hypercubes
- Application of cut polyhedra. I
- A multifacility location problem on median spaces
- A characterization of cube-hypergraphs
- \(L_ 1\)-embeddability of rectilinear polygons with holes
- Structure of Fibonacci cubes: a survey
- Graphs of some CAT(0) complexes
- On antipodal and diametrical partial cubes
- The edge general position problem
- Characterization of 2-arc-transitive partial cubes
- Medians in median graphs and their cube complexes in linear time
- On some properties of antipodal partial cubes
- A counterexample to Thiagarajan's conjecture on regular event structures
- On partial cubes, well-graded families and their duals with some applications in graphs
- Embeddability of open-ended carbon nanotubes in hypercubes
- Some properties of Bowlin and Brin's color graphs
- On tope graphs of complexes of oriented matroids
- Hypercellular graphs: partial cubes without \(Q_3^-\) as partial cube minor
- On density of subgraphs of halved cubes
- Daisy cubes and distance cube polynomial
- Topological indices of the subdivision of a family of partial cubes and computation of \(\mathrm{SiO}_2\) related structures
- Betweenness in graphs: a short survey on shortest and induced path betweenness
- Quasi--distance-balanced graphs
- Mirror graphs: graph theoretical characterization of reflection arrangements and finite Coxeter groups
- Topes of oriented matroids and related structures
- A theorem on Wiener-type invariants for isometric subgraphs of hypercubes
- A negative answer to a problem on generalized Fibonacci cubes
- A correction of a characterization of planar partial cubes
- On finding convex cuts in general, bipartite and plane graphs
- On bipartite graphs whose interval space is a closed join space
- Rhombellane space filling
- Regular connected bipancyclic spanning subgraphs of hypercubes
- Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes
- Fibonacci \((p,r)\)-cubes as Cartesian products
- Netlike partial cubes. I. General properties
- Combinatorics of lopsided sets
- \(\Theta\)-graceful labelings of partial cubes
- On semicube graphs
- Characterizing flag graphs and incuced subgraphs of Cartesian product graphs
- On the canonical metric representation, average distance, and partial Hamming graphs
- Computing distance moments on graphs with transitive Djoković-Winkler relation
- Isometric Hamming embeddings of weighted graphs
- Cut method and Djoković-Winkler's relation
- Convex excess in partial cubes
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)