{"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":23,"n_cols":5,"rows_kept":23,"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],[16,2,16,3],[17,2,17,3],[21,2,21,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910254068603321"]
[null,null,"Autore",null,"Zhang Ping"]
[null,null,"Titolo",null,"A kaleidoscopic view of graph colorings / / by Ping Zhang"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016"]
[null,null,"ISBN",null,"3-319-30518-2"]
[null,null,"Edizione",null,"[1st ed. 2016.]"]
[null,null,"Descrizione fisica",null,"1 online resource (160 p.)"]
[null,null,"Collana",null,"SpringerBriefs in Mathematics, , 2191-8198"]
[null,null,"Disciplina",null,"511.56"]
[null,null,"Soggetti",null,"Graph theory"]
[{"$nulls":4},"Combinatorial analysis"]
[{"$nulls":4},"Applied mathematics"]
[{"$nulls":4},"Engineering mathematics"]
[{"$nulls":4},"Graph Theory"]
[{"$nulls":4},"Combinatorics"]
[{"$nulls":4},"Applications of Mathematics"]
[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 index."]
[null,null,"Nota di contenuto",null,"1. Introduction -- 2. Binomial Edge Colorings -- 3. Kaleidoscopic Edge Colorings -- 4. Graceful Vertex Colorings -- 5.Harmonious Vertex Colorings -- 6. A Map Coloring Problem -- 7. Set Colorings -- 8. Multiset Colorings -- 9. Metric Colorings -- 10. Sigma Colorings -- 11. Modular Colorings -- 12. A Banquet Seating Problem -- 13. Irregular Colorings -- 14. Recognizable Colorings -- References -- Index. ."]
[null,null,null,"Sommario/riassunto","This book describes kaleidoscopic topics that have developed in the area of graph colorings. Unifying current material on graph coloring, this book describes current information on vertex and edge colorings in graph theory, including harmonious colorings, majestic colorings, kaleidoscopic colorings and binomial colorings. Recently there have been a number of breakthroughs in vertex colorings that give rise to other colorings in a graph, such as graceful labelings of graphs that have been reconsidered under the language of colorings. The topics presented in this book include sample detailed proofs and illustrations, which depicts elements that are often overlooked. This book is ideal for graduate students and researchers in graph theory, as it covers a broad range of topics and makes connections between recent developments and well-known areas in graph theory."]