Chinhoyi University Of Technology OPAC
Image from Google Jackets

Introduction to graph theory / by Douglas B. West.

By: Material type: TextTextPublisher: Upper Saddle River, N.J. : Prentice Hall, [2001]Copyright date: ©2001Edition: Second editionDescription: xix, 588 pages : illustrations ; 25 cmContent type:
  • text
Media type:
  • unmediated
Carrier type:
  • volume
ISBN:
  • 9788120321427
Subject(s): Additional physical formats: Online version:: Introduction to graph theory.LOC classification:
  • QA166 .W43 2001
Online resources:
Contents:
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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)

Includes bibliographical references (pages 537-568) and indexes.

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.

There are no comments on this title.

to post a comment.
@2023 All rights reserved. C.U.T Library