03303cam 2200397 i 450000100090000000300060000900500170001500800410003201000170007302000180009004000280010804200080013605000210014408200210016508400450018610000290023124500830026025000120034326000340035530000350038949000460042450000290047050400510049952017530055065000430230365000420234665000540238865000510244270000160249370000160250990600450252594200120257095500510258299900170263395202550265017892138IIITD20180417181547.0130919s2014 flua b 001 0 eng a 2013038209 a9781439880180 aDLCbengerdacDLCdDLC apcc00aQA166b.H36 201400a511.5223bGRO-H aMAT036000aCOM046000aCOM0513002bisacsh aGross, Jonathan L. (ed.)00aHandbook of graph theorycedited by Jonathan L. Gross, Jay Yellen, Ping Zhang. a2nd ed. aLondon :bCRC Press,cÃ2014. axix, 1610 p. :bill. ;c26 cm.0 aDiscrete mathematics and its applications a"A Chapman & Hall book." aIncludes bibliographical references and index. 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"-- 0aGraph theoryvHandbooks, manuals, etc. 7aMATHEMATICS / Combinatorics.2bisacsh 7aCOMPUTERS / Operating Systems / General.2bisacsh 7aCOMPUTERS / Programming / Algorithms.2bisacsh1 aYellen, Jay1 aZhang, Ping a7bcbccorignewd1eecipf20gy-gencatlg 2ddccBK brl07 2013-09-19irl07 2013-09-19 ONIX to Dewey c24436d24436 00102ddc406REF_511_500000000000000_GROH718MATH921826aIIITbIIITcREFd2018-04-17g7320.04oREF 511.5 GRO-Hp008657r2018-04-17v¹115.00w2018-04-17yBKeTB7207f2018-03-31jIIITD/LIC/BS/2015/05/92k2018-03-27xTechnical Bureau India Pvt. Ltd.