scientific article; zbMATH DE number 975398
From MaRDI portal
Publication:5284075
zbMATH Open0862.05038MaRDI QIDQ5284075FDOQ5284075
Publication date: 19 May 1997
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 3264776
- On optimal realizations of finite metric spaces by graphs
- scientific article; zbMATH DE number 4012654
- On metric dimension of graphs and their complements
- On {ℓ}-Metric Dimensions in Graphs
- On the metric dimension of some families of graphs
- Measures of Graphs on the Reals
- scientific article; zbMATH DE number 6739348
- Realizability of graphs
- The metric dimension and girth of graphs
treespanning treesshortest pathcharacterizationshortest path treegraph realization of metricsminimum-cost Hamilton circuit
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Distance in graphs (05C12) Paths and cycles (05C38)
Cited In (12)
- Maximal buttonings of trees
- A constructive algorithm for realizing a distance matrix
- Minimum spanning trees for tree metrics: Abridgements and adjustments
- Title not available (Why is that?)
- Graph-theoretical conditions for inscribability and Delaunay realizability
- Title not available (Why is that?)
- On optimal realizations of finite metric spaces by graphs
- The realizable extension problem and the weighted graph \((K _{3,3}, l)\)
- A note on tree realizations of matrices
- Title not available (Why is that?)
- A note on PM-compact bipartite graphs
- The Complexity of Metric Realization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5284075)
