skip to content
Introduction to graph theory Preview this item
ClosePreview this item
Checking...

Introduction to graph theory

Author: Douglas Brent West
Publisher: Upper Saddle River, N.J. : Prentice Hall, ©2001.
Edition/Format:   Book : English : 2nd edView all editions and formats
Database:WorldCat
Summary:

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  Read more...

Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Additional Physical Format: Online version:
West, Douglas Brent.
Introduction to graph theory.
Upper Saddle River, N.J. : Prentice Hall, ©2001
(OCoLC)625260323
Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Douglas Brent West
ISBN: 0130144002 9780130144003
OCLC Number: 43903794
Description: xix, 588 pages : illustrations ; 25 cm
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.
Responsibility: Douglas B. West.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/43903794>
library:oclcnum"43903794"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:MediaObject
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:bookEdition"2nd ed."
schema:copyrightYear"2001"
schema:creator
schema:datePublished"2001"
schema:description"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."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/33011453>
schema:inLanguage"en"
schema:name"Introduction to graph theory"@en
schema:publication
schema:publisher
schema:workExample
umbel:isLike<http://bnb.data.bl.uk/id/resource/GBA132708>
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.