You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis 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.
Euclidean Constructibility in Graph-Minimization Problems
E. J. Cockayne and Z. A. Melzak
Vol. 42, No. 4 (Sep., 1969), pp. 206-208
Published by: Mathematical Association of America
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 something inaccurate? Let us know!