View Item 

Show simple item record

THE EXPLOSIVE GROWTH OF GRAPH THEORY

dc.contributor.authorHarary, Franken_US
dc.date.accessioned2010-06-01T20:11:37Z
dc.date.available2010-06-01T20:11:37Z
dc.date.issued1979-06en_US
dc.identifier.citationHarary, Frank (1979). "THE EXPLOSIVE GROWTH OF GRAPH THEORY." Annals of the New York Academy of Sciences 328(1 Topics in Graph Theory ): 5-11. <http://hdl.handle.net/2027.42/73316>en_US
dc.identifier.issn0077-8923en_US
dc.identifier.issn1749-6632en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/73316
dc.format.extent355483 bytes
dc.format.extent3109 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.publisherBlackwell Publishing Ltden_US
dc.rights1979 The New York Academy of Sciencesen_US
dc.titleTHE EXPLOSIVE GROWTH OF GRAPH THEORYen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelScience (General)en_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Mathematics University of Michigan Ann Arbor, Michigan 48109en_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/73316/1/j.1749-6632.1979.tb17762.x.pdf
dc.identifier.doi10.1111/j.1749-6632.1979.tb17762.xen_US
dc.identifier.sourceAnnals of the New York Academy of Sciencesen_US
dc.identifier.citedreferenceBerge, C. 1958. Theorie des Graphes et ses Applications. Dunod, Paris.en_US
dc.identifier.citedreferenceBerman, G. 1975. Forward Citations in Graph Theory. University of Waterloo. Waterloo, Canada.en_US
dc.identifier.citedreferenceBerman, G. 1977. Applied Graph Theory Bibliography with Forward Citations. University of Waterloo, Waterloo. Canada.en_US
dc.identifier.citedreferenceBerman, G. 1977. Frequently cited publications in pure graph theory. J. Graph Theory 1: 175 – 180.en_US
dc.identifier.citedreferenceBerman, G. & D. M. Jackson. 1976. Forward Citations in Enumerations. University of Waterloo, Waterloo, Canada.en_US
dc.identifier.citedreferenceBiggs, N., K. Lloyd & R. Wilson. 1976. Graph Theory 1736–1936. Oxford University Press, Oxford.en_US
dc.identifier.citedreferenceDeo, N. 1969. An extensive English language bibliography on graph theory and its applications. Jet Propulsion Laboratory, Pasadena, Technical Report (October); Supplement 1 (April 15, 1971).en_US
dc.identifier.citedreferenceFiedler, M. Editor. 1964. Theory of Graphs and its Applications, Academia, Prague.en_US
dc.identifier.citedreference9. Graph Theory Newsletter. Supplement: A List of Books in Graph Theory and Related Areas 2 ( 197 ), No. 4.en_US
dc.identifier.citedreferenceHarary, F. 1969. Graph Theory, Addison-Wesley, Reading, Mass.en_US
dc.identifier.citedreferenceKÖnig, D. 1936. Theorie der endlichen und unendlichen Graphen. Leipzig, Reprinted Chelsea: New York ( 1950 ).en_US
dc.identifier.citedreferenceMay, K. O. 1968/69. Growth and quality of the mathematical literature. Isis. 59: 363 – 371.en_US
dc.identifier.citedreferenceTurner, J. 1969. Key-word index bibliography of graph theory. Proof Techniques in Graph Theory. F. Harary, Ed. Academic Press, New York. N.Y. pp. 189 – 330.en_US
dc.identifier.citedreferenceTurner, J. & W. H. Katz. 1970. A survey of progress in graph theory in the Soviet Union. SIAM Review (Supplement). 12: 1 – 68.en_US
dc.identifier.citedreferenceVeblen, O. 1922. Analysis Situs. Amer. Math. Soc. Colloq. Publ. Vol. 5. Cambridge. ( 2d edit. New York. 1931 ).en_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
j.1749-6632.1979.tb17762.x.pdf
Size:
347.1KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.