MARC Record from marc_columbia

LEADER: 02173cam a2200361 a 4500
001 7686527
005 20221201020833.0
008 000413t20012001njua b 001 0 eng
010 $a 00039993
015 $aGBA1-32708
020 $a0130144002
020 $a9780130144003
035 $a(OCoLC)ocm43903794
035 $a(NNC)7686527
035 $a7686527
040 $aDLC$cDLC$dUKM$dUBA$dMUQ$dBAKER$dNLGGC$dVP@$dBTCTA$dYDXCP$dCS1
050 00 $aQA166$b.W43 2001
082 00 $a511/.5$221
084 $a31.12$2bcl
100 1 $aWest, Douglas Brent.$0http://id.loc.gov/authorities/names/n86848051
245 10 $aIntroduction to graph theory /$cDouglas B. West.
250 $a2nd ed.
260 $aUpper Saddle River, N.J. :$bPrentice Hall,$c[2001], ©2001.
300 $axix, 588 pages :$billustrations ;$c25 cm
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
504 $aIncludes bibliographical references (p. 537-568) and indexes.
505 0 $ach. 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.
650 0 $aGraph theory.$0http://id.loc.gov/authorities/subjects/sh85056471
650 7 $aTEORIA DOS GRAFOS.$2larpcal
650 6 $aGraphes, Théorie des.
650 17 $aGrafentheorie.$2gtt
852 00 $bsci$hQA166$i.W43 2001