Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4653610 | European Journal of Combinatorics | 2014 | 12 Pages |
Abstract
We prove that a Cayley graph can be embedded in the Euclidean plane without accumulation points of vertices if and only if it is the 1-skeleton of a Cayley complex that can be embedded in the plane after removing redundant simplices. We also give a characterisation of these Cayley graphs in term of group presentations, and deduce that they can be effectively enumerated.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Agelos Georgakopoulos,