Distance-preserving subgraphs of hypercubes
From MaRDI portal
Publication:2555084
DOI10.1016/0095-8956(73)90010-5zbMATH Open0245.05113OpenAlexW2097956810WikidataQ60587834 ScholiaQ60587834MaRDI QIDQ2555084FDOQ2555084
Authors: Dragomir Ž. Đoković
Publication date: 1973
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(73)90010-5
Cites Work
Cited In (only showing first 100 items - show all)
- Fast recognition algorithms for classes of partial cubes
- A note on Winkler's algorithm for factoring a connected graph
- Computing equivalence classes among the edges of a graph with applications
- On bipartite graphs whose interval space is a closed join space
- Supremal \(p\)-negative type of vertex transitive graphs
- Isometric embedding of subdivided Connected graphs in the hypercube
- Isometric embeddings of subdivided complete graphs in the hypercube
- Cage-amalgamation graphs, a common generalization of chordal and median graphs
- A characterization of hypercubes
- Recognizing binary Hamming graphs inO(n 2 logn) time
- \(\Theta\)-graceful labelings of partial cubes
- \(\ell_ 1\)-rigid graphs
- The \(t\)-median function on graphs
- On the remoteness function in median graphs
- Antipodal graphs and oriented matroids
- Distance regular subgraphs of a cube
- Regular connected bipancyclic spanning subgraphs of hypercubes
- Decomposition and \(l_1\)-embedding of weakly median graphs
- Fullerenes and coordination polyhedra versus half-cube embeddings
- A poset-based approach to embedding median graphs in hypercubes and lattices
- Isometric embedding in products of complete graphs
- Characterization of products of trees and grids
- Calculating the edge Wiener and edge Szeged indices of graphs
- Convexity in partial cubes: the hull number
- On cubical graphs
- Partial cubes: Structures, characterizations, and constructions
- On the difference between the (revised) Szeged index and the Wiener index of cacti
- Cover-preserving order embeddings into Boolean lattices
- A dynamic location problem for graphs
- None of the coronoid systems can be isometrically embedded into a hypercube
- Cubic inflation, mirror graphs, regular maps, and partial cubes
- Application of cut polyhedra. I
- On tope graphs of complexes of oriented matroids
- Embeddability of open-ended carbon nanotubes in hypercubes
- On the geodesic pre-hull number of a graph
- Graphs of some CAT(0) complexes
- Wiener number of vertex-weighted graphs and a chemical application
- Separation of two convex sets in convexity structures
- Cut method and Djoković-Winkler's relation
- Isometric embeddings in Hamming graphs
- On the complexity of testing a graph for n-cube
- The retracts of Hamming graphs
- Collapse of the metric hierarchy for bipartite graphs
- Combinatorics of lopsided sets
- Hypercube embeddings and Cayley graphs generated by transpositions
- Vertex cut method for degree and distance-based topological indices and its applications to silicate networks
- On the complexity of the embedding problem for hypercube related graphs
- Characterizing graphs with fully positive semidefinite \(Q\)-matrices
- Isometric embeddings of subdivided connected graphs into hypercubes
- Weak sense of direction labelings and graph embeddings
- What do trees and hypercubes have in common?
- Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes
- Tiled partial cubes
- Netlike partial cubes. I. General properties
- Sums of cuts and bipartite metrics
- Cover-preserving embeddings of bipartite orders into Boolean lattices
- Isometric subgraphs of Hamming graphs and d-convexity
- Topes of oriented matroids and related structures
- Structure of Fibonacci cubes: a survey
- Lattice embeddings of trees
- A mathematical approach on representation of competitions: competition cluster hypergraphs
- Hypercube embedding of generalized bipartite metrics
- Convex excess in partial cubes
- On the canonical metric representation, average distance, and partial Hamming graphs
- Isometric embeddings into cube-hypergraphs
- Hamiltonian laceability of hypercubes without isometric subgraphs
- Clin d'oeil on \(L_1\)-embeddable planar graphs
- Quasi-median graphs, their generalizations, and tree-like equalities
- An Euler-type formula for median graphs
- A multifacility location problem on median spaces
- The lattice dimension of a graph
- 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
- Mostar index
- Fast recognition of classes of almost-median graphs
- On cube-free median graphs
- Characterizing almost-median graphs
- Hamming polynomials and their partial derivatives
- Characterizing flag graphs and incuced subgraphs of Cartesian product graphs
- A characterization of cube-hypergraphs
- On Isometric Embeddings of Graphs
- Netlike partial cubes, IV: Fixed finite subgraph theorems
- Netlike partial cubes II. Retracts and netlike subgraphs
- A theorem on Wiener-type invariants for isometric subgraphs of hypercubes
- Medians in median graphs and their cube complexes in linear time
- An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength
- Cubes polynomial and its derivatives
- On the natural imprint function of a graph
- Topological indices of the subdivision of a family of partial cubes and computation of \(\mathrm{SiO}_2\) related structures
- Mirror graphs: graph theoretical characterization of reflection arrangements and finite Coxeter groups
- Graphene Derivatives: Carbon Nanocones and CorSu Lattice: A Topological Approach
- Labeled sample compression schemes for complexes of oriented matroids
- Betweenness in graphs: a short survey on shortest and induced path betweenness
- A relation between the cube polynomials of partial cubes and the clique polynomials of their crossing graphs
- The number of edges in a subgraph of a Hamming graph
- Hypercellular graphs: partial cubes without \(Q_3^-\) as partial cube minor
- A negative answer to a problem on generalized Fibonacci cubes
- Isometric Diamond Subgraphs
- \(L_ 1\)-embeddability of rectilinear polygons with holes
- Isometric Hamming embeddings of weighted graphs
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)