If you need an accessible version of this item please contact JSTOR User Support

Euclidean Constructibility in Graph-Minimization Problems

E. J. Cockayne and Z. A. Melzak
Mathematics Magazine
Vol. 42, No. 4 (Sep., 1969), pp. 206-208
DOI: 10.2307/2688541
Stable URL: http://www.jstor.org/stable/2688541
Page Count: 3
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
Euclidean Constructibility in Graph-Minimization Problems
Preview not available

Page Thumbnails

  • Thumbnail: Page 
206
    206
  • Thumbnail: Page 
207
    207
  • Thumbnail: Page 
208
    208