000			02025cam a22003374a 4500
001			17028849
003			IIITD
005			20201113020002.0
008			111031s2012 nju b 001 0 eng
010			_a 2011044318
020			_a9788126566198
040			_aDLC _cDLC _dDLC
042			_apcc
050	0	0	_aQA164 _b.T83 2012
082	0	0	_a511.6 _223 _bTUC-A
084			_aMAT036000 _2bisacsh
100	1		_aTucker, Alan
245	1	0	_aApplied combinatorics _cAlan Tucker
250			_a6th ed.
260			_aNew Delhi : _bWiley, _c©1995
300			_axv, 480 p. ; _cill. : _b25 cm.
504			_aIncludes bibliographical references and index.
505	8		_aMachine generated contents note: Prelude. Part One: Graph Theory. Chapter 1: Elements of Graph Theory. Chapter 2: Covering Circuits and Graph coloring. Chapter 3: Trees and Searching. Chapter 4: Network Algorithms. Part Two: Enumeration. Chapter 5: General Counting Methods for Arrangements and Selections. Chapter 6: Generating Functions. Chapter 7: Recurrence Relations. Chapter 8: Inclusion-Exclusion. Part Three: Additional Topics. Chapter 9: Polya's Enumeration Formula. Chapter 10: Games with Grapes. Postlude. Appendix.
520			_a"Alan Tucker's newest issue of Applied Combinatorics builds on the previous editions with more in depth analysis of computer systems in order to help develop proficiency in basic discrete math problem solving. As one of the most widely used book in combinatorial problems, this edition explains how to reason and model combinatorically while stressing the systematic analysis of different possibilities, exploration of the logical structure of a problem, and ingenuity"--
650		0	_aCombinatorial analysis.
650		0	_aGraph theory.
650		7	_aMATHEMATICS / Combinatorics. _2bisacsh
906			_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg
942			_2ddc _cBK _08
999			_c14026 _d14026