000490627 000__ 02718cam\a2200373\a\4500
000490627 001__ 490627
000490627 005__ 20210513172146.0
000490627 006__ m\\\\\o\\d\\\\\\\\
000490627 007__ cr\cn|||||||||
000490627 008__ 080130s2008\\\\dcua\\\\o\\\\\001\0\eng\d
000490627 010__ $$z  2008922013
000490627 020__ $$z0883857537
000490627 020__ $$z9780883857533
000490627 020__ $$z9780883857755
000490627 020__ $$z9780883859698 (e-book)
000490627 035__ $$a(CaPaEBR)ebr10733067
000490627 035__ $$a(OCoLC)857078197
000490627 040__ $$aCaPaEBR$$cCaPaEBR
000490627 05014 $$aQA166$$b.M37 2008eb
000490627 08204 $$a511.5$$222
000490627 1001_ $$aMarcus, Daniel A.,$$d1945-
000490627 24510 $$aGraph theory$$h[electronic resource] :$$ba problem oriented approach /$$cDaniel A. Marcus.
000490627 260__ $$aWashington, D.C. :$$bMathematical Association of America,$$cc2008.
000490627 300__ $$axvi, 205 p. :$$bill.
000490627 440_0 $$aMAA textbooks
000490627 500__ $$aIncludes index.
000490627 506__ $$aAccess limited to authorized users.
000490627 520__ $$a"Graph Theory presents a natural, reader-friendly way to learn some of the essential ideas of graph theory starting from first principles. The format is similar to the companion text, Combinatorics: A Problem Oriented Approach also by Daniel A. Marcus, in that it combines the features of a textbook with those of a problem workbook. The material is presented through a series of approximately 360 strategically placed problems with connecting text. This is supplemented by 280 additional problems that are intended to be used as homework assignments. Concepts of graph theory are introduced, developed, and reinforced by working through leading questions posed in the problems. This problem-oriented format is intended to promote active involvement by the reader while always providing clear direction. This approach figures prominently on the presentation of proofs, which become more frequent and elaborate as the book progresses. Arguments are arranged in digestible chunks and always appear along with concrete examples to keep the readers firmly grounded in their motivation. Spanning tree algorithms, Euler paths, Hamilton paths and cycles, planar graphs, independence and covering, connections and obstructions, and vertex and edge colorings make up the core of the book. Hall's Theorem, the Konig-Egervary Theorem, Dilworth's Theorem and the Hungarian algorithm to the optional assignment problem, matrices, and Latin squares are also explored."--Back cover.
000490627 650_0 $$aGraph theory.
000490627 650_0 $$aGraph theory$$vProblems, exercises, etc.
000490627 7102_ $$aMathematical Association of America.
000490627 852__ $$bebk
000490627 85640 $$3ProQuest Ebook Central Academic Complete$$uhttps://univsouthin.idm.oclc.org/login?url=http://site.ebrary.com/lib/usiricelib/Doc?id=10733067$$zOnline Access
000490627 909CO $$ooai:library.usi.edu:490627$$pGLOBAL_SET
000490627 980__ $$aEBOOK
000490627 980__ $$aBIB
000490627 982__ $$aEbook
000490627 983__ $$aOnline