{"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":14,"n_cols":5,"rows_kept":14,"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],[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],[10,2,10,3],[13,2,13,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466495303316"]
[null,null,"Titolo",null,"Combinatorial Mathematics VIII [[electronic resource] ] : Proceedings of the Eighth Australian Conference on Combinatorial Mathematics Held at Deakin University, Geelong, Australia, August 25-29, 1980 / / edited by K. L. McAvaney"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1981"]
[null,null,"ISBN",null,"3-540-38792-7"]
[null,null,"Edizione",null,"[1st ed. 1981.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XVI, 360 p.)"]
[null,null,"Collana",null,"Lecture Notes in Mathematics, , 0075-8434 ; ; 884"]
[null,null,"Disciplina",null,"511.6"]
[null,null,"Soggetti",null,"Combinatorics"]
[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","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,"Nota di contenuto",null,"Some properties of H-designs -- Computation of some number-theoretic coverings -- The search for long paths and cycles in vertex-transitive graphs and digraphs -- On strongly hamiltonian abelian group graphs -- Monochromatic lines in partitions of Zn -- Complete stable marriages and systems of I-M preferences -- The construction of finite projective planes -- A survey of graph generation techniques -- Graphs and two-distance sets -- Finite Ramsey theory is hard -- Further results on coverin integers of the form 1+k2N by primes -- Distributive block structures and their automorphisms -- Connected subgraphs of the graph of multigraphic realisations of a degree sequence -- A construction for a family of sets and its application to matroids -- Regularity and optimality for trees -- Simple and multigraphic realizations of degree sequences -- Critical link identification in a network -- Enumeration of binary phylogenetic trees -- Minimisatin of multiple entry finite automata -- A singular direct product for quadruple systems -- The maximum number of intercalates in a latin square -- Elegant odd rings and non-planar graphs -- On critical sets of edges in graphs -- Further evidence for a conjecture on two-point deleted subgraphs of cartesian products -- Deques, trees and lattice paths -- Graeco-latin and nested row and column designs -- Contrained switchings in graphs -- One-factorisations of wreath products -- Divisible semisymmetric designs -- Graphs and universal algebras -- Universal fabrics."]