{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":22,"n_cols":5,"rows_kept":22,"cut":false,"hidden":false,"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],[11,2,11,3],[12,2,12,3],[13,2,13,3],[14,2,14,3],[15,2,15,3],[16,2,16,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9911018810203321"]
[null,null,"Autore",null,"Merris Russell <1943->"]
[null,null,"Titolo",null,"Graph theory / / Russell Merris"]
[null,null,"Pubbl/distr/stampa",null,"New York, : John Wiley, c2001"]
[null,null,"ISBN",null,"9786613281128"]
[{"$nulls":4},"9781118031292"]
[{"$nulls":4},"1118031296"]
[{"$nulls":4},"9781283281126"]
[{"$nulls":4},"1283281120"]
[{"$nulls":4},"9781118033043"]
[{"$nulls":4},"1118033043"]
[null,null,"Descrizione fisica",null,"xi, 237 p. : ill"]
[null,null,"Collana",null,"Wiley-Interscience series in discrete mathematics and optimization"]
[null,null,"Disciplina",null,"511/.5"]
[null,null,"Soggetti",null,"Graph theory"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","\"A Wiley-Interscience publication.\""]
[null,null,null,"Nota di bibliografia","Includes bibliographical references (p. 227) and indexes."]
[null,null,null,"Sommario/riassunto","A lively invitation to the flavor, elegance, and power of graph theory This mathematically rigorous introduction is tempered and enlivened by numerous illustrations, revealing examples, seductive applications, and historical references. An award-winning teacher, Russ Merris has crafted a book designed to attract and engage through its spirited exposition, a rich assortment of well-chosen exercises, and a selection of topics that emphasizes the kinds of things that can be manipulated, counted, and pictured. Intended neither to be a comprehensive overview nor an encyclopedic reference, this focused treatment goes deeply enough into a sufficiently wide variety of topics to illustrate the flavor, elegance, and power of graph theory. Another unique feature of the book is its user-friendly modular format. Following a basic foundation in Chapters 1-3, the remainder of the book is organized into four strands that can be explored independently of each other. These strands center, respectively, around matching theory; planar graphs and hamiltonian cycles; topics involving chordal graphs and oriented graphs that naturally emerge from recent developments in the theory of graphic sequences; and an edge coloring strand that embraces both Ramsey theory and a self-contained introduction to "]
[{"$nulls":4},"Pólya's enumeration of nonisomorphic graphs. In the edge coloring strand, the reader is presumed to be familiar with the disjoint cycle factorization of a permutation. Otherwise, all prerequisites for the book can be found in a standard sophomore course in linear algebra. The independence of strands also makes Graph Theory an excellent resource for mathematicians who require access to specific topics without wanting to read an entire book on the subject."]