On Metric Generators of Graphs

References

• Buneman Peter. A note on the metric properties of trees. J. Combin. Theory (B) (1974) 17:48–50Crossref, Google Scholar
• Chartrand Gary, Eroh Linda, Johnson Mark A., Oellermann Ortrud R. Resolvability in graphs and the metric dimension of a graph. Discrete Appl. Math. (2000) 105:99–113Crossref, Google Scholar
• Deza Michel Marie, Laurent Monique. Geometry of Cuts and Metrics (1991) (Springer, Berlin, Germany) Google Scholar
• Frank András. A survey on T-joins T-cuts, and conservative weightings. Combinatorics, Paul Erdős is Eighty (1996) 2:213–252Google Scholar
• Garey M., Johnson D.Computers and Intractability (1979) (W. H. Freeman, San Francisco, CA) Google Scholar
• Katona G. O. H. Combinatorial search problems. Survey Comb. Theory Symp. (1971) (Colorado State University, Fort Collins, CO) 285–3081971Google Scholar
• Korach E., Penn M. Tight integral duality gap in the Chinese postman problem. Math. Programming (1992) 55:183–191Crossref, Google Scholar
• Lindström Bernt. On a combinatory detection problem I. A Magyar Tudományos Akadémia Matematikai Kutató Intézetének Közleményei (1964) 9:195–206Google Scholar
• Lindström Bernt. On a combinatorial problem in number theory. Canadian Math. Bull (1965) 8:477–490Crossref, Google Scholar
• Lindström Bernt. On a combinatory detection problem II. Stud. Sci. Math. Hungaria (1966) 1:353–361Google Scholar
• Middendorf M., Pfeiffer F. On the complexity of the edge-disjoint path problem. Combinatorica (1998) 8:103–116Google Scholar
• Sebő András, Eric Tannier, Gerards Aardal. Connected joins in graphs. Integer Programming and Combinatorial Optimization (2001) 383–395Lecture Notes in Computer Sci., No. 2081Crossref, Google Scholar
• Seymour Paul. On odd cuts and plane multicommodity flows. Proc. London Math. Soc. (1981) 42:178–192Crossref, Google Scholar