Introduction to graph theory /
West, Douglas Brent.
Introduction to graph theory / - Second edition - Upper Saddle River, N.J. : Prentice Hall, ©2001. - xix, 588 pages : illustrations ; - Pearson modern classic .
Originally published in 2001, reissued as part of Pearson's modern classic series.
ch. 1. Fundamental concepts: What is a graph? --
Paths, cycles, and trails --
Vertex degrees and counting --
Directed graphs --
ch. 2. Trees and distance: Basic properties --
Spanning trees and enumeration --
Optimization and trees --
ch. 3. Matchings and factors: Matchings and covers --
Algorithms and applications --
Matchings in general graphs --
ch. 4. Connectivity and paths: Cuts and connectivity --
k-connected graphs --
Network flow problems --
ch. 5. Coloring of graphs: Vertex colorings and upper bounds --
Structure of k-chromatic graphs --
Enumerative aspects --
ch. 6. Planar graphs: Embeddings and Euler's formula --
Characterization of Planar graphs --
Parameters of planarity --
ch. 7. Edges and cycles: Line graphs and edge-coloring --
Hamiltonion cycles --
Planarity, coloring, and cycles --
ch. 8. Additional topics (optional): Perfect graphs --
Matroids --
Ramsey theory --
More extremeal problems --
Random graphs --
Eigenvalues of graphs.
Offering a comprehensive introduction to the fundamental topics of graph theory, this text is for undergraduate or graduate courses in Graph Theory. It includes basic algorithms and emphasizes the understanding and writing of proofs about graphs. It also contains examples and exercises to develop an understanding of the structure of graphs
9780131437371 (pbk.) 0131437372 (pbk.) 8120321421
Graph theory.
511.5 / WES
Introduction to graph theory / - Second edition - Upper Saddle River, N.J. : Prentice Hall, ©2001. - xix, 588 pages : illustrations ; - Pearson modern classic .
Originally published in 2001, reissued as part of Pearson's modern classic series.
ch. 1. Fundamental concepts: What is a graph? --
Paths, cycles, and trails --
Vertex degrees and counting --
Directed graphs --
ch. 2. Trees and distance: Basic properties --
Spanning trees and enumeration --
Optimization and trees --
ch. 3. Matchings and factors: Matchings and covers --
Algorithms and applications --
Matchings in general graphs --
ch. 4. Connectivity and paths: Cuts and connectivity --
k-connected graphs --
Network flow problems --
ch. 5. Coloring of graphs: Vertex colorings and upper bounds --
Structure of k-chromatic graphs --
Enumerative aspects --
ch. 6. Planar graphs: Embeddings and Euler's formula --
Characterization of Planar graphs --
Parameters of planarity --
ch. 7. Edges and cycles: Line graphs and edge-coloring --
Hamiltonion cycles --
Planarity, coloring, and cycles --
ch. 8. Additional topics (optional): Perfect graphs --
Matroids --
Ramsey theory --
More extremeal problems --
Random graphs --
Eigenvalues of graphs.
Offering a comprehensive introduction to the fundamental topics of graph theory, this text is for undergraduate or graduate courses in Graph Theory. It includes basic algorithms and emphasizes the understanding and writing of proofs about graphs. It also contains examples and exercises to develop an understanding of the structure of graphs
9780131437371 (pbk.) 0131437372 (pbk.) 8120321421
Graph theory.
511.5 / WES