
- 200 pages
- English
- ePUB (mobile friendly)
- Available on iOS & Android
Graph Theory
About this book
The Cambridge Graph Theory Conference, held at Trinity College from 11 to 13 March 1981, brought together top ranking workers from diverse areas of the subject. The papers presented were by invitation only. This volume contains most of the contniutions, suitably refereed and revised.For many years now, graph theory has been developing at a great pace and in many directions. In order to emphasize the variety of questions and to preserve the freshness of research, the theme of the meeting was not restricted. Consequently, the papers in this volume deal with many aspects of graph theory, including colouring, connectivity, cycles, Ramsey theory, random graphs, flows, simplicial decompositions and directed graphs. A number of other papers are concerned with related areas, including hypergraphs, designs, algorithms, games and social models.This wealth of topics should enhance the attractiveness of the volume.
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Cover image
- Title page
- Table of Contents
- annals of discrete mathematics
- Copyright page
- Foreword
- Characterizations and Classifications of Biconnected Graphs
- Line Graphs and their Chromatic Polynomials
- Large Graphs with Given Degree and Diameter III
- Distinguishing Vertices of Random Graphs
- The Trail Number of a Graph
- Message Graphs
- Sets of Graphs Colourings
- On Hadwiger’s Number and the Stability Number
- A Depth-First-Search Characterization of Planarity
- Graph-Theoretical Model of Social Organization*
- ODD Cycles of Specified Length in Non-Bipartite Graphs
- Simplicial Decompositions: Some New Aspects and Applications
- Achievement and Avoidance Games for Graphs
- Embedding Incomplete Latin Rectangles
- Edge-Colouring Regular Bipartite Graphs
- Some Colouring Problems and their Complexity
- A Hamiltonian Game
- Finite Ramsey Theory and Strongly Regular Graphs
- The Connectivities of a Graph and Its Complement1
- Annals of Discrete Mathematics