Graph theoretic models
dc.contributor.author | Harary, Frank | en_US |
dc.date.accessioned | 2006-04-07T17:24:05Z | |
dc.date.available | 2006-04-07T17:24:05Z | |
dc.date.issued | 1980-06 | en_US |
dc.identifier.citation | Harary, Frank (1980/06)."Graph theoretic models." Theoretical Computer Science 11(2): 117-121. <http://hdl.handle.net/2027.42/23224> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6V1G-45FSVKD-5V/2/eccf6b4503f0a49115f2f8e0668f29de | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/23224 | |
dc.format.extent | 573519 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | Graph theoretic models | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Mathematics, University of Michigan, Ann Arbor, MI 48109, U.S.A. | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/23224/1/0000157.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0304-3975(80)90041-9 | en_US |
dc.identifier.source | Theoretical Computer Science | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
-
Interdisciplinary and Peer-Reviewed
-
Mathematical Geography, Institute of (IMaGe)
Publications and Scholarly Research Projects.
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.