skip to content
How to construct graphs. Preview this item
ClosePreview this item
Checking...

How to construct graphs.

Author: G E Shilov; I P Natanson
Publisher: Boston, Heath [1963]
Series: Topics in mathematics.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Additional Physical Format: Online version:
Shilov, G.E. (Georgiĭ Evgenʹevich).
How to construct graphs.
Boston, Heath [1963]
(OCoLC)561713835
Document Type: Book
All Authors / Contributors: G E Shilov; I P Natanson
OCLC Number: 494814
Description: 53 pages illustrations 21 cm.
Series Title: Topics in mathematics.
Other Titles: Simplest maxima and minima problems
Responsibility: Translated and adapted from the 1st Russian ed. (1959) by Jerome Kristian and Daniel A. Levine. Simplest maxima and minima problems [by] I.P. Natanson. Translated and adapted from the 3d Russian ed. (1960) by C. Clark Kissinger and Robert B. Brown.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(2)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/494814>
library:oclcnum"494814"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/494814>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:creator
schema:datePublished"1963"
schema:exampleOfWork<http://worldcat.org/entity/work/id/1588554>
schema:inLanguage"en"
schema:name"How to construct graphs."@en
schema:name"Simplest maxima and minima problems"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.