{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"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":39,"n_cols":5,"rows_kept":39,"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],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[11,2,11,3],[11,4,11,5],[12,2,12,3],[12,4,12,5],[13,2,13,3],[14,2,14,3],[21,2,21,3],[22,2,22,3],[23,2,23,3],[24,2,24,3],[25,2,25,3],[26,2,26,3],[28,2,28,3],[29,2,29,3],[33,2,33,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910991295603321"]
[null,null,"Autore",null,"Uffelen, Chris  van"]
[null,null,"Titolo",null,"Buildings for books : contemporary library architecture / Chris van Uffelen"]
[null,null,"Pubbl/distr/stampa",null,"Salenstein, : Braun, 2024"]
[null,null,"ISBN",null,"9783037682937"]
[null,null,"Descrizione fisica",null,"221 p. : ill. ; 29 cm"]
[null,null,"Locazione",null,"FARBC"]
[null,null,"Collocazione",null,"BIBL C 76"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"2.","Record Nr.",null,"UNINA9910954453803321"]
[null,null,"Titolo",null,"Graph edge coloring : Vizing's theorem and Goldberg's conjecture / / Michael Stiebitz ... [et al.]"]
[null,null,"Pubbl/distr/stampa",null,"Hoboken, N.J., : Wiley, 2012"]
[null,null,"ISBN",null,"9786613621443"]
[{"$nulls":4},"9781118205594"]
[{"$nulls":4},"1118205596"]
[{"$nulls":4},"9781280591617"]
[{"$nulls":4},"1280591617"]
[{"$nulls":4},"9781118205563"]
[{"$nulls":4},"1118205561"]
[null,null,"Edizione",null,"[1st ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (339 p.)"]
[null,null,"Collana",null,"Wiley series in discrete mathematics and optimization"]
[null,null,"Classificazione",null,"MAT008000"]
[null,null,"Disciplina",null,"511/.56"]
[null,null,"Soggetti",null,"Graph coloring"]
[{"$nulls":4},"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","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and indexes."]
[null,null,"Nota di contenuto",null,"Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture; CONTENTS; Preface; 1 Introduction; 1.1 Graphs; 1.2 Coloring Preliminaries; 1.3 Critical Graphs; 1.4 Lower Bounds and Elementary Graphs; 1.5 Upper Bounds and Coloring Algorithms; 1.6 Notes; 2 Vizing Fans; 2.1 The Fan Equation and the Classical Bounds; 2.2 Adjacency Lemmas; 2.3 The Second Fan Equation; 2.4 The Double Fan; 2.5 The Fan Number; 2.6 Notes; 3 Kierstead Paths; 3.1 Kierstead's Method; 3.2 Short Kierstead's Paths; 3.3 Notes; 4 Simple Graphs and Line Graphs; 4.1 Class One and Class Two Graphs"]
[{"$nulls":4},"4.2 Graphs whose Core has Maximum Degree Two4.3 Simple Overfull Graphs; 4.4 Adjacency Lemmas for Critical Class Two Graphs; 4.5 Average Degree of Critical Class Two Graphs; 4.6 Independent Vertices in Critical Class Two Graphs; 4.7 Constructions of Critical Class Two Graphs; 4.8 Hadwiger's Conjecture for Line Graphs; 4.9 Simple Graphs on Surfaces; 4.10 Notes; 5 Tashkinov Trees; 5.1 Tashkinov's Method; 5.2 Extended Tashkinov Trees; 5.3 Asymptotic Bounds; 5.4 Tashkinov's Coloring Algorithm; 5.5 Polynomial Time Algorithms; 5.6 Notes; 6 Goldberg's Conjecture"]
[{"$nulls":4},"6.1 Density and Fractional Chromatic Index6.2 Balanced Tashkinov "]
[{"$nulls":4},"Trees; 6.3 Obstructions; 6.4 Approximation Algorithms; 6.5 Goldberg's Conjecture for Small Graphs; 6.6 Another Classification Problem for Graphs; 6.7 Notes; 7 Extreme Graphs; 7.1 Shannon's Bound and Ring Graphs; 7.2 Vizing's Bound and Extreme Graphs; 7.3 Extreme Graphs and Elementary Graphs; 7.4 Upper Bounds for χ' Depending on Δ and μ; 7.5 Notes; 8 Generalized Edge Colorings of Graphs; 8.1 Equitable and Balanced Edge Colorings; 8.2 Full Edge Colorings and the Cover Index; 8.3 Edge Colorings of Weighted Graphs"]
[{"$nulls":4},"8.4 The Fan Equation for the Chromatic Index χ'f8.5 Decomposing Graphs into Simple Graphs; 8.6 Notes; 9 Twenty Pretty Edge Coloring Conjectures; Appendix A: Vizing's Two Fundamental Papers; A.1 On an Estimate of the Chromatic Class of a p-Graph; References; A.2 Critical Graphs with a Given Chromatic Class; References; Appendix B: Fractional Edge Colorings; B.1 The Fractional Chromatic Index; B.2 The Matching Polytope; B.3 A Formula for χ'f*; References; Symbol Index; Name Index; Subject Index"]
[null,null,null,"Sommario/riassunto","\"Written by world authorities on graph theory, this book features many new advances and applications in graph edge coloring, describes how the results are interconnected, and provides historial context throughout. Chapter coverage includes an introduction to coloring preliminaries and lower and upper bounds; the Vizing fan; the Kierstead path; simple graphs and line graphs of multigraphs; the Tashkinov tree; Goldberg's conjecture; extreme graphs; generalized edge coloring; and open problems. It serves as a reference for researchers interested in discrete mathematics, graph theory, operations research, theoretical computer science, and combinatorial optimization, as well as a graduate-level course book for students of mathematics, optimization, and computer science\"--"]