{"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":25,"n_cols":5,"rows_kept":25,"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],[13,2,13,3],[14,2,14,3],[15,2,15,3],[16,2,16,3],[17,2,17,3],[18,2,18,3],[22,2,22,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910457917403321"]
[null,null,"Autore",null,"Golumbic Martin Charles"]
[null,null,"Titolo",null,"Tolerance graphs / / Martin Charles Golumbic, Ann N. Trenk [[electronic resource]]"]
[null,null,"Pubbl/distr/stampa",null,"Cambridge : , : Cambridge University Press, , 2004"]
[null,null,"ISBN",null,"1-107-14728-X"]
[{"$nulls":4},"1-280-44950-0"]
[{"$nulls":4},"9786610449507"]
[{"$nulls":4},"0-511-18563-4"]
[{"$nulls":4},"0-511-18480-8"]
[{"$nulls":4},"0-511-18745-9"]
[{"$nulls":4},"0-511-31356-X"]
[{"$nulls":4},"0-511-54298-4"]
[{"$nulls":4},"0-511-18652-5"]
[null,null,"Descrizione fisica",null,"1 online resource (xii, 265 pages) : digital, PDF file(s)"]
[null,null,"Collana",null,"Cambridge studies in advanced mathematics ; ; 89"]
[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","Title from publisher's bibliographic system (viewed on 05 Oct 2015)."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references (p. 253-259) and indexes."]
[null,null,"Nota di contenuto",null,"Introduction -- Early work on tolerance graphs -- Trees, cotrees and bipartite graphs -- Interval probe graphs -- Bitolerance graphs and ordered sets -- Unit and 50% tolerance graphs -- Comparability and invariance results -- Bounded bitolerance recognition -- Algorithms on tolerance graphs -- The hierarchy of bitolerance orders -- Tolerance models on trees -- Phi-tolerance models -- Directed tolerance graphs -- Open questions and further directions."]
[null,null,null,"Sommario/riassunto","The study of algorithmic graph theory and structured families of graphs is an important branch of discrete mathematics. It finds numerous applications, from data transmission through networks to efficiently scheduling aircraft and crews, as well as contributing to breakthroughs in genetic analysis and studies of the brain. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. One of these is the study of tolerance graphs and tolerance orders. This book contains the first thorough study of tolerance graphs and related topics, indeed the authors have included proofs of major results "]
[{"$nulls":4},"previously unpublished in book form. It will act as a springboard for researchers, and especially graduate students, to pursue new directions of investigation. With many examples and exercises it is also suitable for use as the text for a graduate course in graph theory."]