000			02884nam a2200409 a 4500
001			EBC3330424
003			MiAaPQ
006			m o d |
007			cr cn|||||||||
008			080130s2008 dcua s 001 0 eng d
010			_z 2008922013
020			_z0883857537
020			_z9780883857533
020			_z9780883857755
020			_z9780883859698 (e-book)
035			_a(MiAaPQ)EBC3330424
035			_a(Au-PeEL)EBL3330424
035			_a(CaPaEBR)ebr10733067
035			_a(OCoLC)857078197
040			_aMiAaPQ _cMiAaPQ _dMiAaPQ
050		4	_aQA166 _b.M37 2008
082	0	4	_a511.5 _222
100	1		_aMarcus, Daniel A., _d1945-
245	1	0	_aGraph theory _h[electronic resource] : _ba problem oriented approach / _cDaniel A. Marcus.
260			_aWashington, D.C. : _bMathematical Association of America, _cc2008.
300			_axvi, 205 p. : _bill.
440		0	_aMAA textbooks
500			_aIncludes index.
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.
533			_aElectronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.
650		0	_aGraph theory.
650		0	_aGraph theory _vProblems, exercises, etc.
655		4	_aElectronic books.
710	2		_aMathematical Association of America.
710	2		_aProQuest (Firm)
856	4	0	_uhttps://ebookcentral.proquest.com/lib/nird-ebooks/detail.action?docID=3330424 _zClick to View
999			_c25122 _d25122