Combinatorial theory and statistical design : Gregory M. Constantine, (John Wiley & Sons, New York, Chichester, Brisbane, Toronto, Singapore, 1987) 472 pages.

• Book ID: 103060072
• Publisher: Elsevier Science
• Year: 1989
• Tongue: English
• Weight: 135 KB
• Volume: 76
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/0012-365x(89)90294-x

✦ Synopsis

Book announcements graph. 2-tell embeddings of graphs. The maximum genus of a graph. Chapter 5: Connectivity and networks. n-Connected and n-edge-connected graphs. Menger's theorem. Networks. The max-flow min-cut theorem. Applications of the max-flow mm-cut theorem. Chapter 6: Hamiltonian Graphs and Digraphs. Hamiltonian graphs. Hamiltonian planar graphs. Hamiltonian digraphs. Chapter 7: Oriented Graphs. Robbins' theorem. Tournaments. Hamiltonian tournaments. Score sequences of tournaments. Chapter 8: Factors and Factorizations. Matchings. Factorizations. Decompositions. Coverings. Chapter 9: Graphs and Groups. The group and edge-group of a graph. Cayley color graphs. Line graphs. Chapter 10: Graph Colorings. Vertex colorings. Edge colorings. Map colorings. Chapter 11: fitred Graph Theory and Ramsey Theory. Extremal graph theory. Ramsey numbers. Generalized Ramsey theory. Chapter 12: Enumeration of Graphs and Digraphs. P6lya's theorem. Graphical and digraphical enumeration. Glossary of Symbols. Bibliography. Index.