𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

The Planar Cubic Cayley Graphs

✍ Scribed by Agelos Georgakopoulos


Publisher
American Mathematical Society
Year
2018
Tongue
English
Leaves
94
Series
Memoirs of the American Mathematical Society
Edition
1
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


The author obtains a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. He obtains counterexamples to conjectures of Mohar, Bonnington and Watkins. The author's analysis makes the involved graphs accessible to computation, corroborating a conjecture of Droms.

✦ Subjects


Cayley graphs. ; Graph connectivity. ; Graph theory.


πŸ“œ SIMILAR VOLUMES


Planar graph drawing
✍ T Nishizeki; Md Saidur Rahman πŸ“‚ Library πŸ“… 2004 πŸ› World Scientific 🌐 English
Planar Graph Drawing
✍ Takao Nishizeki, Dr Md Saidur Rahman πŸ“‚ Library πŸ“… 2004 πŸ› World Scientific 🌐 English
Genetic Theory for Cubic Graphs
✍ Pouya Baniasadi, Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe (auth.) πŸ“‚ Library πŸ“… 2016 πŸ› Springer International Publishing 🌐 English

<p><p>This book was motivated by the notion that some of the underlying difficulty in challenging instances of graph-based problems (e.g., the Traveling Salesman Problem) may be β€œinherited” from simpler graphs which – in an appropriate sense – could be seen as β€œancestors” of the given graph instance

Planar Graphs: Theory and Algorithms
✍ T. Nishizeki and N. Chiba (Eds.) πŸ“‚ Library πŸ“… 1988 πŸ› Elsevier Science Ltd 🌐 English

Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two c