## Graphs & Digraphs, Fifth EditionContinuing to provide a carefully written, thorough introduction, Graphs & Digraphs, Fifth Edition expertly describes the concepts, theorems, history, and applications of graph theory. Nearly 50 percent longer than its bestselling predecessor, this edition reorganizes the material and presents many new topics. New to the Fifth Edition - New or expanded coverage of graph minors, perfect graphs, chromatic polynomials, nowhere-zero flows, flows in networks, degree sequences, toughness, list colorings, and list edge colorings
- New examples, figures, and applications to illustrate concepts and theorems
- Expanded historical discussions of well-known mathematicians and problems
- More than 300 new exercises, along with hints and solutions to odd-numbered exercises at the back of the book
- Reorganization of sections into subsections to make the material easier to read
- Bolded definitions of terms, making them easier to locate
Despite a field that has evolved over the years, this student-friendly, classroom-tested text remains the consummate introduction to graph theory. It explores the subject’s fascinating history and presents a host of interesting problems and diverse applications. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Other editions - View all

### Common terms and phrases

1-factor 2-cell embedding 2-connected adjacent algorithm assigned assume bipartite graph boundary chromatic number coloring of G complete graph component of G Conjecture connected graph Corollary cubic graph cut-vertex defined degree sequence degv denoted digraph dominating set edge coloring edge of G embedding of G Eulerian Exercises for Section exists follows G contains G of Figure G of order graph containing graph G graph of order graph theory Hamiltonian cycle Hamiltonian graph Hamiltonian path Hence induced subgraph integer internally disjoint isomorphic labeled Let G maximal planar graph maximum minimum number Moore graph multigraph nonadjacent vertices nonplanar nowhere-zero number of edges obtained partite sets permutation Petersen graph planar graph positive integer proof of Theorem regions result score sequence set of vertices shown in Figure spanning tree subgraph of G subset Suppose tree of order vertex colorings vertex of degree vertex set vertex-cut vertices of G