The planar cubic Cayley graphs

2011/02/10 by Georgakopoulos, Agelos · 1 citation
#05C25 #20F65 #Combinatorics (math.CO) #FOS: Mathematics #Group Theory (math.GR)

paper · doi:10.48550/arxiv.1102.2087

Abstract

We obtain 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. We obtain counterexamples to conjectures of Mohar, Bonnington and Watkins. Our analysis makes the involved graphs accessible to computation, corroborating a conjecture of Droms.

Cited by

• String graphs are quasi-isometric to planar graphs

Related

• The planar cubic Cayley graphs of connectivity 2
• The planar Cayley graphs are effectively enumerable I: consistently planar graphs
• The planar Cayley graphs are effectively enumerable II
• An infinite family of cubic nonnormal Cayley graphs on nonabelian simple groups
• Balanced Cayley graphs and balanced planar graphs