The following pages link to (Q5284075):
Displaying 12 items.
- A constructive algorithm for realizing a distance matrix (Q858334) (← links)
- On optimal realizations of finite metric spaces by graphs (Q1100481) (← links)
- Graph-theoretical conditions for inscribability and Delaunay realizability (Q1356410) (← links)
- Minimum spanning trees for tree metrics: Abridgements and adjustments (Q1907943) (← links)
- The realizable extension problem and the weighted graph \((K _{3,3}, l)\) (Q1928599) (← links)
- Recognizing and realizing cactus metrics (Q2296277) (← links)
- On minimum spanning tree-like metric spaces (Q2357774) (← links)
- A note on PM-compact bipartite graphs (Q2450134) (← links)
- Maximal buttonings of trees (Q2450135) (← links)
- A note on tree realizations of matrices (Q3515389) (← links)
- (Q4890133) (← links)
- (Q4949794) (← links)