Softcover ISBN:  9781470451844 
Product Code:  TEXT/53 
List Price:  $75.00 
MAA Member Price:  $56.25 
AMS Member Price:  $56.25 
eBook ISBN:  9781470451851 
Product Code:  TEXT/53.E 
List Price:  $69.00 
MAA Member Price:  $51.75 
AMS Member Price:  $51.75 
Softcover ISBN:  9781470451844 
eBook: ISBN:  9781470451851 
Product Code:  TEXT/53.B 
List Price:  $144.00 $109.50 
MAA Member Price:  $108.00 $82.13 
AMS Member Price:  $108.00 $82.13 
Softcover ISBN:  9781470451844 
Product Code:  TEXT/53 
List Price:  $75.00 
MAA Member Price:  $56.25 
AMS Member Price:  $56.25 
eBook ISBN:  9781470451851 
Product Code:  TEXT/53.E 
List Price:  $69.00 
MAA Member Price:  $51.75 
AMS Member Price:  $51.75 
Softcover ISBN:  9781470451844 
eBook ISBN:  9781470451851 
Product Code:  TEXT/53.B 
List Price:  $144.00 $109.50 
MAA Member Price:  $108.00 $82.13 
AMS Member Price:  $108.00 $82.13 

Book DetailsAMS/MAA TextbooksVolume: 53; 2011; 205 pp
Graph Theory presents a natural, readerfriendly 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 problemoriented 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 KonigEgervary Theorem, Dilworth's Theorem and the Hungarian algorithm to the optional assignment problem, matrices, and latin squares are also explored.

Table of Contents

Chapters

Introduction: Problems of Graph Theory

A. Basic Concepts

B. Isomorphic Graphs

C. Bipartite Graphs

D. Trees and Forests

E. Spanning Tree Algorithms

F. Euler Paths

G. Hamilton Paths and Cycles

H. Planar Graphs

I. Independence and Covering

J. Connections and Obstructions

K. Vertex Coloring

L. Edge Coloring

M. Matching Theory for Bipartite Graphs

N, Applications of Matching Theory

O. CycleFree Digraphs

P. Network Flow Theory

Q. Flow Problems with Lower Bounds


Reviews

This work could be the basis for a very nice onesemester "transition" course in which students evolve from users of theorems to creators of proofs. With their intuitive appeal and pictorial representations, graphs may be a better basis than analysis and limits for such a transtion.
Choice


RequestsReview Copy – for publishers of book reviewsDesk Copy – for instructors who have adopted an AMS textbook for a courseExamination Copy – for faculty considering an AMS textbook for a courseAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Reviews
 Requests
Graph Theory presents a natural, readerfriendly 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 problemoriented 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 KonigEgervary Theorem, Dilworth's Theorem and the Hungarian algorithm to the optional assignment problem, matrices, and latin squares are also explored.

Chapters

Introduction: Problems of Graph Theory

A. Basic Concepts

B. Isomorphic Graphs

C. Bipartite Graphs

D. Trees and Forests

E. Spanning Tree Algorithms

F. Euler Paths

G. Hamilton Paths and Cycles

H. Planar Graphs

I. Independence and Covering

J. Connections and Obstructions

K. Vertex Coloring

L. Edge Coloring

M. Matching Theory for Bipartite Graphs

N, Applications of Matching Theory

O. CycleFree Digraphs

P. Network Flow Theory

Q. Flow Problems with Lower Bounds

This work could be the basis for a very nice onesemester "transition" course in which students evolve from users of theorems to creators of proofs. With their intuitive appeal and pictorial representations, graphs may be a better basis than analysis and limits for such a transtion.
Choice