The nine finite, planar, 3-connected, edge-transitive graphs have been known and studied for many centuries. The infinite, locally finite, planar, 3-connected, edge-transitive graphs can be classified according to the number of their end. The 1-ended graphs in this class were identified by Grünbaum and Shephard; Watkins characterized the 2-ended members. Any remaining graphs in this class must have uncountably may ends. In this work, infinite-ended members of this class are shown to exist. A more detailed classification scheme in terms of the types of Petrie walks in the graphs in this class and the local structure of their automorphism groups is presented.
This book presents rigidity theory in a historical context. The combinatorial aspects of rigidity are isolated and framed in terms of a special class of matroids, which are a natural generalization of the connectivity matroid of a graph. The book includes an introduction to matroid theory and an extensive study of planar rigidity. The final chapter is devoted to higher dimensional rigidity, highlighting the main open questions. Also included is an extensive annotated bibiolography with over 150 entries. The book is aimed at graduate students and researchers in graph theory and combinatorics or in fields which apply the structural aspects of these subjects in architecture and engineering. Accessible to those who have had an introduction to graph theory at the senior or graduate level, the book would be suitable for a graduate course in graph theory.
This will help us customize your experience to showcase the most relevant content to your age group
Please select from below
Login
Not registered?
Sign up
Already registered?
Success – Your message will goes here
We'd love to hear from you!
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.