| Record ID | marc_columbia/Columbia-extract-20221130-013.mrc:331498915:3320 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-013.mrc:331498915:3320?format=raw |
LEADER: 03320cam a2200445 a 4500
001 6433846
005 20221122032453.0
008 071016t20082008nyua b 001 0 eng c
010 $a 2007940370
015 $aGBA786916$2bnb
016 7 $a014200514$2Uk
019 $a154712217
020 $a9781846289699 (acid-free paper)
020 $a1846289696 (acid-free paper)
020 $z9781846289705 (e-ISBN)
020 $z184628970X (e-ISBN)
029 1 $aOHX$bhar070060852
035 $a(OCoLC)ocn176832832
035 $a(OCoLC)176832832$z(OCoLC)154712217
035 $a(NNC)6433846
035 $a6433846
040 $aUKM$cUKM$dBTCTA$dBAKER$dMUQ$dTXH$dOHX$dYDXCP$dIQU$dOrLoB-B
042 $apcc
050 4 $aQA166$b.B668 2008
082 04 $a511.5$222
100 1 $aBondy, J. A.$q(John Adrian)$0http://id.loc.gov/authorities/names/n79021396
245 10 $aGraph theory /$cJ.A. Bondy, U.S.R. Murty.
260 $aNew York :$bSpringer,$c[2008], ©2008.
300 $axii, 651 pages :$billustrations ;$c25 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
490 1 $aGraduate texts in mathematics,$x0072-5285 ;$v244
504 $aIncludes bibliographical references (p. 593-622) and index.
505 00 $g1.$tGraphs -- $g2.$tSubgraphs -- $g3.$tConnected graphs -- $g4.$tTrees -- $g5.$tNonseparable graphs -- $g6.$tTree-search algorithms -- $g7.$tFlows in networks -- $g8.$tComplexity of algorithms -- $g9.$tConnectivity -- $g10.$tPlanar graphs -- $g11.$tThe four-colour problem -- $g12.$tStable sets and cliques -- $g13.$tThe probabilistic method -- $g14.$tVertex colourings -- $g15.$tColourings of maps -- $g16.$tMatchings -- $g17.$tEdge colourings -- $g18.$tHamilton cycles -- $g19.$tCoverings and packings in directed graphs -- $g20.$tElectrical networks -- $g21.$tInteger flows and coverings -- $tUnsolved problems -- $tGeneral mathematical notation -- $tGraph parameters -- $tOperations and relations -- $tFamilies of graphs -- $tStructures.
520 1 $a"The primary aim of this book is to present a coherent introduction to the subject, suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science. It provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal. Commonly used proof techniques are described and illustrated, and a wealth of exercises - of varying levels of difficulty - are provided to help the reader master the techniques and reinforce their grasp of the material." "A second objective is to serve as an introduction to research in graph theory. To this end, sections on more advanced topics are included, and a number of interesting and challenging open problems are highlighted and discussed in some detail. Despite this more advanced material, the book has been organized in such a way that an introductory course on graph theory can be based on the first few sections of selected chapters."--BOOK JACKET.
650 0 $aGraph theory.$0http://id.loc.gov/authorities/subjects/sh85056471
650 6 $aGraphes, Théorie des.
700 1 $aMurty, U. S. R.$0http://id.loc.gov/authorities/names/n79007007
830 0 $aGraduate texts in mathematics ;$v244.$0http://id.loc.gov/authorities/names/n83723435
852 00 $bmat$hQA166$i.B668 2008g