The following pages link to The lattice dimension of a graph (Q1775025):
Displaying 25 items.
- Weak sense of direction labelings and graph embeddings (Q628312) (← links)
- Generalized Fibonacci cubes (Q658012) (← links)
- A poset-based approach to embedding median graphs in hypercubes and lattices (Q766140) (← links)
- Optimal strategies in the average consensus problem (Q847130) (← links)
- Partial cubes and their \(\tau\)-graphs (Q875040) (← links)
- On the geodetic number of median graphs (Q941326) (← links)
- Algorithms for media (Q947070) (← links)
- On distance-balanced graphs (Q966128) (← links)
- Partial cubes: Structures, characterizations, and constructions (Q998441) (← links)
- Lattice embeddings of trees (Q1024313) (← links)
- Transitive, locally finite median graphs with finite blocks (Q1043799) (← links)
- Netlike partial cubes, V: completion and netlike classes (Q1043960) (← links)
- Induced cycles in crossing graphs of median graphs (Q1045199) (← links)
- The fiber dimension of a graph (Q1618232) (← links)
- On some characterizations of antipodal partial cubes (Q1717195) (← links)
- Structure of Fibonacci cubes: a survey (Q1956242) (← links)
- On partial cubes, well-graded families and their duals with some applications in graphs (Q2192079) (← links)
- On semicube graphs (Q2519790) (← links)
- Convex excess in partial cubes (Q2891047) (← links)
- Isometric Diamond Subgraphs (Q3611874) (← links)
- (Q4711958) (← links)
- Edge distance-balanced of Hamming graphs (Q5059606) (← links)
- Induced Embeddings into Hamming Graphs. (Q5111242) (← links)
- On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets (Q6063279) (← links)
- Axiomatic characterization of the interval function of partial cubes and partial Hamming graphs (Q6651154) (← links)
