About Planar Cayley Graphs
暂无分享,去创建一个
Regarding non-normal Cayley graphs, we chose to let them aside from that paper. Though we obtained a few results about these, we could not reach the same complete formalism as for normal ones. Besides, they are rather pathological, in the sense that they do not admit imbeddings without singularities, such as accumulation points. For that reason, one may suppose they will not be as efficient models as normal Cayley graphs, and hence be of lesser interest for the community of computer scientists.
[1] R. Lyndon,et al. Combinatorial Group Theory , 1977 .
[2] Jeffrey C. Lagarias,et al. Tiling with polyominoes and combinatorial group theory , 1990, J. Comb. Theory, Ser. A.
[3] W. Thurston. Conway's tiling groups , 1990 .
[4] Jeffrey C. Lagarias,et al. A Polyomino Tiling Problem of Thurston and Its Configurational Entropy , 1993, J. Comb. Theory, Ser. A.
[5] G. C. Shephard,et al. Tilings and Patterns , 1990 .