{"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":19,"n_cols":5,"rows_kept":19,"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],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[14,2,14,3],[15,2,15,3],[17,2,17,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910983304303321"]
[null,null,"Autore",null,"Diestel Reinhard"]
[null,null,"Titolo",null,"Graph Theory / / by Reinhard Diestel"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2025"]
[null,null,"ISBN",null,"9783662701072"]
[{"$nulls":4},"3662701073"]
[null,null,"Edizione",null,"[6th ed. 2025.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XX, 455 p.)"]
[null,null,"Collana",null,"Graduate Texts in Mathematics, , 2197-5612 ; ; 173"]
[null,null,"Disciplina",null,"511.1"]
[null,null,"Soggetti",null,"Discrete mathematics"]
[{"$nulls":4},"Computer science - Mathematics"]
[{"$nulls":4},"Discrete Mathematics"]
[{"$nulls":4},"Mathematical Applications in Computer Science"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"The Basics -- Matching Covering and Packing -- Connectivity -- Planar Graphs -- Colouring -- Flows -- Extremal Graph Theory -- Infinite Graphs -- Ramsey Theory for Graphs -- Hamilton Cycles -- Random Graphs -- Graph Minors."]
[null,null,null,"Sommario/riassunto","This standard textbook on modern graph theory combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject, with concise yet complete proofs, while offering glimpses of more advanced methods in each field via one or two deeper results. This is a major new edition. Among many other improvements, it offers additional tools for applying the regularity lemma, brings the tangle theory of graph minors up to the cutting edge of current research, and addresses new topics such as chi-boundedness in perfect graph theory. The book can be used as a reliable text for an introductory graduate course and is also suitable for self-study. From the reviews: “Deep, clear, wonderful. This is a serious book about the heart of graph theory. It has depth and integrity.” Persi Diaconis & Ron Graham, SIAM Review “The book has received a very enthusiastic reception, which it amply deserves. A masterly elucidation of modern graph theory.” Bulletin of the Institute of Combinatorics and its Applications “Succeeds dramatically ... a hell of a good book.” MAA Reviews “ ... like listening to someone explain mathematics.” Bulletin of the AMS ."]