Algorithmic graph theory and perfect graphs / / Martin Charles Golumbic.

Saved in:
Bibliographic Details
Superior document:Computer Science and Applied Mathematics
VerfasserIn:
Place / Publishing House:New York, New York ;, London, England : : Academic Press,, 1980.
1980
Year of Publication:1980
Language:English
Series:Computer science and applied mathematics.
Online Access:
Physical Description:1 online resource (307 pages) :; illustrations.
Tags: Add Tag
No Tags, Be the first to tag this record!
id 5001888440
ctrlnum (MiAaPQ)5001888440
(Au-PeEL)EBL1888440
(CaPaEBR)ebr10999422
(CaONFJC)MIL679047
(OCoLC)898327016
collection bib_alma
record_format marc
spelling Golumbic, Martin Charles, author.
Algorithmic graph theory and perfect graphs / Martin Charles Golumbic.
New York, New York ; London, England : Academic Press, 1980.
1980
1 online resource (307 pages) : illustrations.
text rdacontent
computer rdamedia
online resource rdacarrier
Computer Science and Applied Mathematics
Includes bibliographical references at the end of each chapters and index.
Description based on print version record.
Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.
Perfect graphs.
Electronic books.
Print version: Golumbic, Martin Charles. Algorithmic graph theory and perfect graphs. New York, New York ; London, England : Academic Press, c1980 xx, 284 pages Computer science and applied mathematics. 9780122892608 79022956
ProQuest (Firm)
Computer science and applied mathematics.
https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=1888440 Click to View
language English
format eBook
author Golumbic, Martin Charles,
spellingShingle Golumbic, Martin Charles,
Algorithmic graph theory and perfect graphs /
Computer Science and Applied Mathematics
author_facet Golumbic, Martin Charles,
author_variant m c g mc mcg
author_role VerfasserIn
author_sort Golumbic, Martin Charles,
title Algorithmic graph theory and perfect graphs /
title_full Algorithmic graph theory and perfect graphs / Martin Charles Golumbic.
title_fullStr Algorithmic graph theory and perfect graphs / Martin Charles Golumbic.
title_full_unstemmed Algorithmic graph theory and perfect graphs / Martin Charles Golumbic.
title_auth Algorithmic graph theory and perfect graphs /
title_new Algorithmic graph theory and perfect graphs /
title_sort algorithmic graph theory and perfect graphs /
series Computer Science and Applied Mathematics
series2 Computer Science and Applied Mathematics
publisher Academic Press,
publishDate 1980
physical 1 online resource (307 pages) : illustrations.
isbn 9781483271972 (e-book)
9780122892608
callnumber-first Q - Science
callnumber-subject QA - Mathematics
callnumber-label QA166
callnumber-sort QA 3166 G64 41980
genre Electronic books.
genre_facet Electronic books.
url https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=1888440
illustrated Illustrated
dewey-hundreds 500 - Science
dewey-tens 510 - Mathematics
dewey-ones 511 - General principles of mathematics
dewey-full 511/.5
dewey-sort 3511 15
dewey-raw 511/.5
dewey-search 511/.5
oclc_num 898327016
work_keys_str_mv AT golumbicmartincharles algorithmicgraphtheoryandperfectgraphs
status_str n
ids_txt_mv (MiAaPQ)5001888440
(Au-PeEL)EBL1888440
(CaPaEBR)ebr10999422
(CaONFJC)MIL679047
(OCoLC)898327016
hierarchy_parent_title Computer Science and Applied Mathematics
is_hierarchy_title Algorithmic graph theory and perfect graphs /
container_title Computer Science and Applied Mathematics
_version_ 1792330803548520448
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01860nam a2200433 i 4500</leader><controlfield tag="001">5001888440</controlfield><controlfield tag="003">MiAaPQ</controlfield><controlfield tag="005">20200520144314.0</controlfield><controlfield tag="006">m o d | </controlfield><controlfield tag="007">cr cnu||||||||</controlfield><controlfield tag="008">150112t19801980nyua ob 001 0 eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780122892608</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781483271972 (e-book)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)5001888440</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Au-PeEL)EBL1888440</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaPaEBR)ebr10999422</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaONFJC)MIL679047</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)898327016</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">MiAaPQ</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="e">pn</subfield><subfield code="c">MiAaPQ</subfield><subfield code="d">MiAaPQ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA166</subfield><subfield code="b">.G64 1980</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</subfield><subfield code="2">19</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Golumbic, Martin Charles,</subfield><subfield code="e">author.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithmic graph theory and perfect graphs /</subfield><subfield code="c">Martin Charles Golumbic.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, New York ;</subfield><subfield code="a">London, England :</subfield><subfield code="b">Academic Press,</subfield><subfield code="c">1980.</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">1980</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (307 pages) :</subfield><subfield code="b">illustrations.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Computer Science and Applied Mathematics</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references at the end of each chapters and index.</subfield></datafield><datafield tag="588" ind1=" " ind2=" "><subfield code="a">Description based on print version record.</subfield></datafield><datafield tag="590" ind1=" " ind2=" "><subfield code="a">Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Perfect graphs.</subfield></datafield><datafield tag="655" ind1=" " ind2="4"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Golumbic, Martin Charles.</subfield><subfield code="t">Algorithmic graph theory and perfect graphs.</subfield><subfield code="d">New York, New York ; London, England : Academic Press, c1980 </subfield><subfield code="h">xx, 284 pages </subfield><subfield code="k">Computer science and applied mathematics.</subfield><subfield code="z">9780122892608 </subfield><subfield code="w">79022956</subfield></datafield><datafield tag="797" ind1="2" ind2=" "><subfield code="a">ProQuest (Firm)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computer science and applied mathematics.</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=1888440</subfield><subfield code="z">Click to View</subfield></datafield></record></collection>