Access

You are not currently logged in.

Access JSTOR through your library or other institution:

login

Log in through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Journal Article

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

You can always find the topics here!

Topics: Vertices, Polynomials, Integers, Unit costs, Coefficients
Were these topics helpful?
See somethings inaccurate? Let us know!

Select the topics that are inaccurate.

Cancel
  • Read Online (Free)
  • Download ($16.00)
  • Subscribe ($19.50)
  • Add to My Lists
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Euclidean Constructibility in Graph-Minimization Problems
Preview not available

Page Thumbnails

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