000			01651nam a2200313 a 4500
005			20221119163736.0
008			060713s2006 nju 000 0 eng d
020			_a9780131679955 . _qhardback
020			_a9780131679955 . _c£56.99 _qhardback
100	1		_aGoodaire, Edgar G.
245	1	0	_aDiscrete mathematics with graph theory / _cEdgar G. Goodaire, Michael M. Parmenter
250			_a3rd ed.
260			_aUpper Saddle River, N.J. : _bPearson Prentice Hall ; _aLondon : _bPearson Education Ltd., _c[2006]
300			_axxi, 461 p., [80]p. : _bfigs. ; _c26 cm
504			_aIncludes index
505	2		_aLogic -- Sets and relations -- Functions -- The integers -- Induction and recursion -- Principles of counting -- Permutations and combinations -- Algorithms -- Graphs -- Paths and circuits -- Applications of paths and circuits -- Trees -- Planar graphs and colorings -- The max flow-min cut theorem
520	8		_aFar more 'user friendly' than the vast majority of similar books, this text is truly written with the 'beginning' reader in mind. The pace is tight, the style is light, and the text emphasizes theorem proving throughout. The authors emphasize 'active reading', a skill vital to success in learning how to think mathematically.
534			_aPrevious ed.: 2002
650		0	_aMathematics _vTextbooks
650		0	_aComputer science _xMathematics _vTextbooks
650		0	_aGraph theory _vTextbooks
650		7	_aMathematics _2thema _99683
650		7	_aDiscrete mathematics _2thema
700	1		_aParmenter, Michael M.
902			_a170321
907			_a.b11199234 _bm _c-
942			_n0
998			_b0 _c061109 _dm _ea _f- _g0
999			_c268633 _d268633