| Record ID | marc_columbia/Columbia-extract-20221130-007.mrc:345529233:1661 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-007.mrc:345529233:1661?format=raw |
LEADER: 01661mam a2200325 a 4500
001 3345116
005 20221020045233.0
008 010410t20022002nyua b 001 0 eng
010 $a 2001035224
015 $aGBA1-51077
020 $a047143809X (cloth : alk. paper)
035 $a(OCoLC)ocm46769566
035 $9AUZ6514CU
035 $a3345116
040 $aDLC$cDLC$dC#P$dUKM$dOCLCQ$dOrLoB-B
050 00 $aQA164$b.T83 2002
082 00 $a511/.6$221
100 1 $aTucker, Alan,$d1943 July 6-$0http://id.loc.gov/authorities/names/n79118717
245 10 $aApplied combinatorics /$cAlan Tucker.
250 $a4th ed.
260 $aNew York :$bJohn Wiley & Sons,$c[2002], ©2002.
300 $aix, 446 pages :$billustrations ;$c25 cm
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
504 $aIncludes bibliographical references and index.
505 00 $gPt. 1.$tGraph Theory.$gCh. 1.$tElements of Graph Theory.$gCh. 2.$tCovering Circuits and Graph Coloring.$gCh. 3.$tTrees and Searching.$gCh. 4.$tNetwork Algorithms --$gPt. 2.$tEnumeration.$gCh. 5.$tGeneral Counting Methods for Arrangements and Selections.$gCh. 6.$tGenerating Functions.$gCh. 7.$tRecurrence Relations.$gCh. 8.$tInclusion-Exclusion --$gPt. 3.$tAdditional Topics.$gCh. 9.$tPolya's Enumeration Formula.$gCh. 10.$tGames with Graphs.$tGlossary of Counting and Graph Theory Terms.
650 0 $aCombinatorial analysis.$0http://id.loc.gov/authorities/subjects/sh85028802
650 0 $aGraph theory.$0http://id.loc.gov/authorities/subjects/sh85056471
856 41 $3Table of Contents$uhttp://www.loc.gov/catdir/toc/onix06/2001035224.html
852 00 $bmat$hQA164$i.T83 2002