Pages that link to "Item:Q2555084"
From MaRDI portal
The following pages link to Distance-preserving subgraphs of hypercubes (Q2555084):
Displaying 50 items.
- Cut method and Djoković-Winkler's relation (Q277477) (← links)
- Vertex cut method for degree and distance-based topological indices and its applications to silicate networks (Q338824) (← links)
- Supremal \(p\)-negative type of vertex transitive graphs (Q412438) (← links)
- Hamiltonian laceability of hypercubes without isometric subgraphs (Q503653) (← links)
- Calculating the edge Wiener and edge Szeged indices of graphs (Q555186) (← links)
- A dynamic location problem for graphs (Q583245) (← links)
- Weak sense of direction labelings and graph embeddings (Q628312) (← links)
- On the connectivity of bipartite distance-balanced graphs (Q658007) (← links)
- Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes. I: Topologies and the geodesic convexity (Q658018) (← links)
- Computing equivalence classes among the edges of a graph with applications (Q686277) (← links)
- A note on Winkler's algorithm for factoring a connected graph (Q686292) (← links)
- Distance regular subgraphs of a cube (Q686314) (← links)
- Antipodal graphs and oriented matroids (Q686471) (← links)
- A poset-based approach to embedding median graphs in hypercubes and lattices (Q766140) (← links)
- A mathematical approach on representation of competitions: competition cluster hypergraphs (Q778654) (← links)
- Two-dimensional partial cubes (Q785580) (← links)
- Not all partial cubes are \(\Theta \)-graceful (Q785832) (← links)
- Isometric embedding in products of complete graphs (Q787171) (← links)
- The \(t\)-median function on graphs (Q858309) (← links)
- On cube-free median graphs (Q864119) (← links)
- Fast recognition of classes of almost-median graphs (Q864135) (← links)
- Characterizing almost-median graphs (Q872051) (← links)
- Partial cubes and their \(\tau\)-graphs (Q875040) (← links)
- Hamming polynomials and their partial derivatives (Q875053) (← links)
- Convexity in partial cubes: the hull number (Q898152) (← links)
- Projection of a medium (Q924534) (← links)
- On the geodetic number of median graphs (Q941326) (← links)
- Media theory: Representations and examples (Q947060) (← links)
- Algorithms for media (Q947070) (← links)
- None of the coronoid systems can be isometrically embedded into a hypercube (Q948707) (← links)
- On the remoteness function in median graphs (Q967439) (← links)
- A characterization of planar partial cubes (Q998403) (← links)
- Partial cubes: Structures, characterizations, and constructions (Q998441) (← links)
- Subdivided graphs as isometric subgraphs of Hamming graphs (Q1024304) (← links)
- Cage-amalgamation graphs, a common generalization of chordal and median graphs (Q1024305) (← links)
- Lattice embeddings of trees (Q1024313) (← links)
- Netlike partial cubes, IV: Fixed finite subgraph theorems (Q1024318) (← links)
- On the geodesic pre-hull number of a graph (Q1024319) (← links)
- Netlike partial cubes II. Retracts and netlike subgraphs (Q1025452) (← links)
- Netlike partial cubes III. The median cycle property (Q1025465) (← links)
- On verifying and engineering the wellgradedness of a union-closed family (Q1042303) (← links)
- Netlike partial cubes, V: completion and netlike classes (Q1043960) (← links)
- Isometric embeddings of subdivided connected graphs into hypercubes (Q1045174) (← links)
- Induced cycles in crossing graphs of median graphs (Q1045199) (← links)
- Collapse of the metric hierarchy for bipartite graphs (Q1089359) (← links)
- Fixed hypercube embedding (Q1108043) (← links)
- Isometric embeddings in Hamming graphs (Q1110526) (← links)
- On the complexity of testing a graph for n-cube (Q1146982) (← links)
- A graph theoretic approach to switching function minimization (Q1168952) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
