02812nam a2200373 a 4500001001200000003000800012006001900020007001500039008004100054010001700095020001500112020001800127020001800145020002700163040002100190035002100211050002300232082001400255100003000269245009200299260006900391300002400460440001800484500002000502520147200522533015201994650001802146650004402164655002902208710004102237710001702278856012602295999001702421ebr10733067CaPaEBRm     o  u        cr cn|||||||||080130s2008    dcua    s     001 0 eng d  z  2008922013  z0883857537  z9780883857533  z9780883857755  z9780883859698 (e-book)  aCaPaEBRcCaPaEBR  a(OCoLC)85707819714aQA166b.M37 2008eb04a511.52221 aMarcus, Daniel A.,d1945-10aGraph theoryh[electronic resource] :ba problem oriented approach /cDaniel A. Marcus.  aWashington, D.C. :bMathematical Association of America,cc2008.  axvi, 205 p. :bill. 0aMAA textbooks  aIncludes index.  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.  aElectronic reproduction.bPalo Alto, Calif. :cebrary,d2013.nAvailable via World Wide Web.nAccess may be limited to ebrary affiliated libraries. 0aGraph theory. 0aGraph theoryvProblems, exercises, etc. 7aElectronic books.2local2 aMathematical Association of America.2 aebrary, Inc.40uhttp://site.ebrary.com/lib/rucke/Doc?id=10733067zAn electronic book accessible through the World Wide Web; click to view  c36716d36716