Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

Cayley graphs --- Graph connectivity --- Graph theory

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The last decade has seen two parallel developments, one in computer science, the other in mathematics, both dealing with the same kind of combinatorial structures: networks with strong symmetry properties or, in graph-theoretical language, vertex-transitive graphs, in particular their prototypical examples, Cayley graphs. In the design of large interconnection networks it was realised that many of the most fre­ quently used models for such networks are Cayley graphs of various well-known groups. This has spawned a considerable amount of activity in the study of the combinatorial properties of such graphs. A number of symposia and congresses (such as the bi-annual IWIN, starting in 1991) bear witness to the interest of the computer science community in this subject. On the mathematical side, and independently of any interest in applications, progress in group theory has made it possible to make a realistic attempt at a complete description of vertex-transitive graphs. The classification of the finite simple groups has played an important role in this respect.

Cayley graphs --- Group theory --- Congresses --- Discrete mathematics. --- Computer science—Mathematics. --- Group theory. --- Computer communication systems. --- Combinatorics. --- Microprocessors. --- Discrete Mathematics. --- Discrete Mathematics in Computer Science. --- Group Theory and Generalizations. --- Computer Communication Networks. --- Processor Architectures. --- Minicomputers --- Combinatorics --- Algebra --- Mathematical analysis --- Communication systems, Computer --- Computer communication systems --- Data networks, Computer --- ECNs (Electronic communication networks) --- Electronic communication networks --- Networks, Computer --- Teleprocessing networks --- Data transmission systems --- Digital communications --- Electronic systems --- Information networks --- Telecommunication --- Cyberinfrastructure --- Electronic data processing --- Network computers --- Groups, Theory of --- Substitutions (Mathematics) --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis --- Distributed processing --- Cayley graphs. --- Cayley color graphs --- Cayley color groups --- Cayley diagrams --- Cayley's color graphs --- Cayley's color groups --- Cayley's diagrams --- Cayley's graphs --- Color graphs, Cayley --- Color groups, Cayley --- Dehnsche Gruppenbild --- Diagrams, Cayley --- Gruppenbild, Dehnsche --- Graph theory --- Graphes, Théorie des