Algorithmic graph theory and perfect graphs
(eBook)

Book Cover
Average Rating
Published
New York, New York ; Academic Press, 1980.
Physical Desc
1 online resource (307 pages) : illustrations.
Status

More Details

Format
eBook
Language
English
ISBN
9781483271972 (e-book)

Notes

Bibliography
Includes bibliographical references at the end of each chapters and index.
Local note
Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.

Description

Loading Description...

Also in this Series

Checking series information...

More Like This

Loading more titles like this title...

Reading Recommendations & More

Reviews from GoodReads

Loading GoodReads Reviews.

Citations

APA Citation, 7th Edition (style guide)

Golumbic, M. C. (1980). Algorithmic graph theory and perfect graphs . Academic Press.

Chicago / Turabian - Author Date Citation, 17th Edition (style guide)

Golumbic, Martin Charles. 1980. Algorithmic Graph Theory and Perfect Graphs. Academic Press.

Chicago / Turabian - Humanities (Notes and Bibliography) Citation, 17th Edition (style guide)

Golumbic, Martin Charles. Algorithmic Graph Theory and Perfect Graphs Academic Press, 1980.

MLA Citation, 9th Edition (style guide)

Golumbic, Martin Charles. Algorithmic Graph Theory and Perfect Graphs Academic Press, 1980.

Note! Citations contain only title, author, edition, publisher, and year published. Citations should be used as a guideline and should be double checked for accuracy. Citation formats are based on standards as of August 2021.

Staff View

Grouped Work ID
b361d667-b5ba-8461-6a90-b9f78a93cf5e-eng
Go To Grouped Work

Grouping Information

Grouped Work IDb361d667-b5ba-8461-6a90-b9f78a93cf5e-eng
Full titlealgorithmic graph theory and perfect graphs
Authorgolumbic martin charles
Grouping Categorybook
Last Update2022-07-08 14:58:02PM
Last Indexed2024-05-11 05:08:38AM

Book Cover Information

Image Sourcesyndetics
First LoadedMar 26, 2024
Last UsedMar 26, 2024

Marc Record

First DetectedJul 08, 2022 04:33:11 PM
Last File Modification TimeJul 08, 2022 04:33:11 PM

MARC Record

LEADER02207nam a2200457 i 4500
001EBC1888440
003MiAaPQ
00520200520144314.0
006m     o  d |      
007cr cnu||||||||
008150112t19801980nyua    ob    001 0 eng d
020 |z 9780122892608
020 |a 9781483271972 (e-book)
035 |a (MiAaPQ)EBC1888440
035 |a (Au-PeEL)EBL1888440
035 |a (CaPaEBR)ebr10999422
035 |a (CaONFJC)MIL679047
035 |a (OCoLC)898327016
040 |a MiAaPQ|b eng|c MiAaPQ|d MiAaPQ|e rda|e pn
050 4|a QA166|b .G64 1980
0820 |a 511/.5|2 19
1001 |a Golumbic, Martin Charles,|e author.
24510|a Algorithmic graph theory and perfect graphs /|c Martin Charles Golumbic.
264 1|a New York, New York ;|a London, England :|b Academic Press,|c 1980.
264 4|c ©1980
300 |a 1 online resource (307 pages) :|b illustrations.
336 |a text|2 rdacontent
337 |a computer|2 rdamedia
338 |a online resource|2 rdacarrier
4901 |a Computer Science and Applied Mathematics
504 |a Includes bibliographical references at the end of each chapters and index.
588 |a Description based on print version record.
590 |a Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.
650 0|a Perfect graphs.
655 4|a Electronic books.
77608|i Print version:|a Golumbic, Martin Charles.|t Algorithmic graph theory and perfect graphs.|d New York, New York ; London, England : Academic Press, c1980 |h xx, 284 pages |k Computer science and applied mathematics.|z 9780122892608 |w 79022956
7972 |a ProQuest (Firm)
830 0|a Computer science and applied mathematics.
85640|u http://ebookcentral.proquest.com/lib/yavapai-ebooks/detail.action?docID=1888440|x Yavapai College|y Yavapai College users click here
85640|u http://ebookcentral.proquest.com/lib/prescottcollege-ebooks/detail.action?docID=1888440|x Prescott College|y Prescott College users click here<U+000a>
85640|u http://ebookcentral.proquest.com/lib/yln-ebooks/detail.action?docID=1888440|x Yavapai Library Network|y All other users click here