000			03058cam a2200385 i 4500
001			17892138
003			IIITD
005			20210203135810.0
008			130919s2014 flua b 001 0 eng
010			_a 2013038209
020			_a9781439880180
040			_aDLC _beng _erda _cDLC _dDLC
042			_apcc
050	0	0	_aQA166 _b.H36 2014
082	0	0	_a511.5 _223 _bGRO-H
084			_aMAT036000 _aCOM046000 _aCOM051300 _2bisacsh
245	0	0	_aHandbook of graph theory _cedited by Jonathan L. Gross, Jay Yellen and Ping Zhang.
250			_a2nd ed.
260			_aLondon : _bCRC Press, _c©2014.
300			_axix, 1610 p. : _bill. ; _c26 cm.
490	0		_aDiscrete mathematics and its applications
500			_a"A Chapman & Hall book."
504			_aIncludes bibliographical references and index.
520			_a"Over the past fifty years, graph theory has been one of the most rapidly growing areas of mathematics. Since 1960, more than 10,000 different authors have published papers classifed as graph theory by Math Reviews, and for the past decade, more than 1000 graph theory papers have been published each year. Not surprisingly, this Second Edition is about 450 pages longer than the First Edition, which appeared in 2004. This Handbook is intended to provide as comprehensive a view of graph theory as is feasible in a single volume. Many of our chapters survey areas that have large research communities, with hundreds of active mathematicians, and which could be developed into independent handbooks. The 89 contributors to this volume, 31 of whom are new to this edition, collectively represent perhaps as much as 90% or more of the main topics in pure and applied graph theory. Thirteen of the sections in the Second Edition cover newer topics that did not appear in the First Edition. In order to achieve this kind of comprehensiveness, we challenged our contributors to restrict their expository prose to a bare minimum, by adhering to the ready-reference style of the CRC Handbook series, which emphasizes quick accessibility for the non- expert. We thank the contributors for responding so well to this challenge. The 13 chapters of the Handbook are organized into 65 sections. Within each section, several major topics are presented. For each topic, there are lists of the essential definitions and facts, accompanied by examples, tables, remarks, and in some cases, conjectures and open problems. Each section ends with a bibliography of references tied directly to that section. In many cases, these bibliographies are several pages long"--
650		0	_aGraph theory _vHandbooks, manuals, etc.
650		7	_aMATHEMATICS / Combinatorics. _2bisacsh
650		7	_aCOMPUTERS / Operating Systems / General. _2bisacsh
650		7	_aCOMPUTERS / Programming / Algorithms. _2bisacsh
700	1		_aYellen, Jay _eeditor
700	1		_aZhang, Ping _eeditor
700	1		_aGross, Jonathan L. _eeditor
906			_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg
942			_2ddc _cBK
999			_c24436 _d24436