{"text_format":"5","workbook":"xls","n_sheets":1,"sheets":["report2"],"props":{"last_modified_by":"sharecat"},"not_rendered":{"external_links":1,"defined_names":1},"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":18,"n_cols":5,"rows_kept":18,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[7,2,7,3],[8,2,8,3],[10,2,10,3],[12,2,12,3],[13,2,13,3],[16,2,16,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910808322203321"]
[null,null,"Autore",null,"Vasudev C"]
[null,null,"Titolo",null,"Combinatorics and graph theory [[electronic resource] /] / C. Vasudev"]
[null,null,"Pubbl/distr/stampa",null,"New Delhi, : New Age International (P) Ltd., Publishers, c2007"]
[null,null,"ISBN",null,"1-282-24085-4"]
[{"$nulls":4},"9786612240850"]
[{"$nulls":4},"81-224-2890-8"]
[null,null,"Descrizione fisica",null,"1 online resource (577 p.)"]
[null,null,"Disciplina",null,"511.6"]
[{"$nulls":4},"511/.6"]
[null,null,"Soggetti",null,"Combinatorial analysis"]
[{"$nulls":4},"Graph theory"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[{"$nulls":3},"Livello bibliografico","Monografia"]
[{"$nulls":3},"Note generali","Includes index."]
[null,null,"Nota di contenuto",null,"Cover; Preface; Contents; Unit 1. Counting Principles and Generating Functions; Unit 2. Recurrence Relations; Unit 3. Graphs and Trees; Unit 4. Cutsets, Networkflows and Planar Graphs; Unit 5. Coloring, Digraphs and Enumeration; Index"]
[{"$nulls":3},"Sommario/riassunto","About the Book:  This text has been carefully designed for flexible use for First Semester M.C.A. course of Uttar Pradesh Technical University (U.P.T.U.), and it contains the following features:  Precise mathematical language is used without excessive formalism and abstraction.  Over 900 exercises (problem sets) in the text with many different types of questions posed.  Care has been taken to balance the mix of notation and words in mathematical statements.  Problem sets (exercises) are stated clearly and unambiguously and all are carefully graded for various levels of difficulty.    Contents:"]