Graph theory : a problem oriented approach / / Daniel A. Marcus.

"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 text...

Full description

Saved in:
Bibliographic Details
:
TeilnehmendeR:
Year of Publication:2008
Language:English
Series:MAA textbooks
Online Access:
Physical Description:xvi, 205 p. :; ill.
Notes:Includes index.
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 02887nam a2200409 a 4500
001 5003330424
003 MiAaPQ
005 20200520144314.0
006 m o d |
007 cr cn|||||||||
008 080130s2008 dcua s 001 0 eng d
010 |z  2008922013 
020 |z 0883857537 
020 |z 9780883857533 
020 |z 9780883857755 
020 |a 9780883859698 (electronic bk.) 
035 |a (MiAaPQ)5003330424 
035 |a (Au-PeEL)EBL3330424 
035 |a (CaPaEBR)ebr10733067 
035 |a (OCoLC)857078197 
040 |a MiAaPQ  |c MiAaPQ  |d MiAaPQ 
050 4 |a QA166  |b .M37 2008 
082 0 4 |a 511.5  |2 22 
100 1 |a Marcus, Daniel A.,  |d 1945- 
245 1 0 |a Graph theory  |h [electronic resource] :  |b a problem oriented approach /  |c Daniel A. Marcus. 
260 |a Washington, D.C. :  |b Mathematical Association of America,  |c c2008. 
300 |a xvi, 205 p. :  |b ill. 
440 0 |a MAA textbooks 
500 |a Includes 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 |a Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries. 
650 0 |a Graph theory. 
650 0 |a Graph theory  |v Problems, exercises, etc. 
655 4 |a Electronic books. 
710 2 |a Mathematical Association of America. 
710 2 |a ProQuest (Firm) 
856 4 0 |u https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=3330424  |z Click to View