Distance-preserving subgraphs of hypercubes
From MaRDI portal
Publication:2555084
DOI10.1016/0095-8956(73)90010-5zbMath0245.05113OpenAlexW2097956810WikidataQ60587834 ScholiaQ60587834MaRDI QIDQ2555084
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
Related Items
Convex excess in partial cubes, 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, Tiled partial cubes, Computing distance moments on graphs with transitive Djoković-Winkler relation, Ample Completions of Oriented Matroids and Complexes of Uniform Oriented Matroids, A correction of a characterization of planar partial cubes, On finding convex cuts in general, bipartite and plane graphs, An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength, On some properties of antipodal partial cubes, Regular Connected Bipancyclic Spanning Subgraphs of Torus Networks, Lattice Points of Cut Cones, On bipartite graphs whose interval space is a closed join space, Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles, When Can Splits be Drawn in the Plane?, FUNDAMENTALS OF MEDIA THEORY, Recognizing binary Hamming graphs inO(n 2 logn) time, A counterexample to Thiagarajan's conjecture on regular event structures, Rhombellane space filling, On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets, Isometric embeddings of subdivided complete graphs in the hypercube, Hypercube embeddings and Cayley graphs generated by transpositions, On partial cubes, well-graded families and their duals with some applications in graphs, Edge general position sets in Fibonacci and Lucas cubes, Graphs with \(G^p\)-connected medians, Characterizing graphs with fully positive semidefinite \(Q\)-matrices, Factorization and pseudofactorization of weighted graphs, Regular connected bipancyclic spanning subgraphs of hypercubes, \(l_1\)-embeddability of shifted quadrilateral cylinder graphs, First-order logic axiomatization of metric graph theory, ON SOME PROPERTIES OF QUASI-DISTANCE-BALANCED GRAPHS, Isometric Hamming embeddings of weighted graphs, Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes, Omega Polynomial in Nanostructures, Further Results on Two Families of Nanostructures, Graphene Derivatives: Carbon Nanocones and CorSu Lattice: A Topological Approach, Mathematical Aspects of Omega Polynomial, Fibonacci \((p,r)\)-cubes as Cartesian products, On Isometric Embeddings of Graphs, On the dimension of vertex labeling of k-uniform dcsl of an even cycle, Netlike partial cubes. I. General properties, Transit sets of two-point crossover, Packing the hypercube, Combinatorics of lopsided sets, Embeddability of open-ended carbon nanotubes in hypercubes, \(\Theta\)-graceful labelings of partial cubes, Unnamed Item, Some properties of Bowlin and Brin's color graphs, Isometric Diamond Subgraphs, On tope graphs of complexes of oriented matroids, On semicube graphs, Hypercellular graphs: partial cubes without \(Q_3^-\) as partial cube minor, Isometric subgraphs of Hamming graphs and d-convexity, 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, What Do Trees and Hypercubes Have in Common?, Characterizing flag graphs and incuced subgraphs of Cartesian product graphs, On the canonical metric representation, average distance, and partial Hamming graphs, Cubes polynomial and its derivatives, Isometric embedding of subdivided Connected graphs in the hypercube, Θ-graphs of partial cubes and strong edge colorings, Quasi-\(\lambda\)-distance-balanced graphs, Mirror graphs: graph theoretical characterization of reflection arrangements and finite Coxeter groups, Medians in median graphs and their cube complexes in linear time, Partial cubes and Archimedean tilings, Separation of two convex sets in convexity structures, Cut method and Djoković-Winkler's relation, Convexity in finite metric spaces, Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements, Collapse of the metric hierarchy for bipartite graphs, Isometric embeddings into cube-hypergraphs, Application of cut polyhedra. I, On the natural imprint function of a graph, Characterization of products of trees and grids, The \(t\)-median function on graphs, Vertex cut method for degree and distance-based topological indices and its applications to silicate networks, Fixed hypercube embedding, Isometric embeddings in Hamming graphs, On cube-free median graphs, Fast recognition of classes of almost-median graphs, Characterizing almost-median graphs, A multifacility location problem on median spaces, A characterization of cube-hypergraphs, Clin d'oeil on \(L_1\)-embeddable planar graphs, Wiener number of vertex-weighted graphs and a chemical application, Partial cubes and their \(\tau\)-graphs, Hamming polynomials and their partial derivatives, \(L_ 1\)-embeddability of rectilinear polygons with holes, On the difference between the (revised) Szeged index and the Wiener index of cacti, Retracts of infinite Hamming graphs, Cover-preserving embeddings of bipartite orders into Boolean lattices, Quasi-median graphs, their generalizations, and tree-like equalities, Supremal \(p\)-negative type of vertex transitive graphs, Interval routing in some planar networks., Convexity in partial cubes: the hull number, Isometric embeddings of subdivided wheels in hypercubes, On the complexity of testing a graph for n-cube, Weak sense of direction labelings and graph embeddings, Fast recognition algorithms for classes of partial cubes, Partition distance in graphs, Structure of Fibonacci cubes: a survey, Mostar index, Distance-based topological indices of nanosheets, nanotubes and nanotori of SiO\(_2\), Cubic inflation, mirror graphs, regular maps, and partial cubes, On some characterizations of antipodal partial cubes, A graph theoretic approach to switching function minimization, Projection of a medium, 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, Representations of graphs and networks (coding, layouts and embeddings), Graphs of some CAT(0) complexes, The Szeged index and the Wiener index of partial cubes with applications to chemical graphs, On the geodetic number of median graphs, Distance-preserving subgraphs of Johnson graphs, Hamiltonian laceability of hypercubes without isometric subgraphs, Media theory: Representations and examples, Algorithms for media, None of the coronoid systems can be isometrically embedded into a hypercube, The retracts of Hamming graphs, Computing equivalence classes among the edges of a graph with applications, A note on Winkler's algorithm for factoring a connected graph, Distance regular subgraphs of a cube, Antipodal graphs and oriented matroids, Cover-preserving order embeddings into Boolean lattices, On the remoteness function in median graphs, On the immersion of digraphs in cubes, On cubical graphs, On simplicial and cubical complexes with short links, Calculating the edge Wiener and edge Szeged indices of graphs, The lattice dimension of a graph, A characterization of hypercubes, A dynamic location problem for graphs, A characterization of planar partial cubes, Partial cubes: Structures, characterizations, and constructions, On antipodal and diametrical partial cubes, On the complexity of the embedding problem for hypercube related graphs, Sums of cuts and bipartite metrics, 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, A poset-based approach to embedding median graphs in hypercubes and lattices, Boolean layer cakes, A mathematical approach on representation of competitions: competition cluster hypergraphs, 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, Two-dimensional partial cubes, Not all partial cubes are \(\Theta \)-graceful, Decomposition and \(l_1\)-embedding of weakly median graphs, Isometric embedding in products of complete graphs, Hypercube embedding of generalized bipartite metrics, An Euler-type formula for median graphs, Fullerenes and coordination polyhedra versus half-cube embeddings, The edge general position problem, Characterization of 2-arc-transitive partial cubes, The number of edges in a subgraph of a Hamming graph, Intersection graphs of maximal hypercubes, \(\ell_ 1\)-rigid graphs
Cites Work
