Grannell, Mike and Knor, Martin
(2011).
*Australasian Journal of Combinatorics*, 51 pp. 259–270.

URL: | http://ajc.maths.uq.edu.au/?page=get_volumes&volum... |
---|---|

Google Scholar: | Look up in Google Scholar |

## Abstract

We investigate a voltage construction for face -colourable triangulations by from the viewpoint of the underlying Latin squares. We prove that if the vertices are relabelled so that one of the Latin squares is exactly the Cayley table of the group , then the other square can be obtained from by a cyclic permutation of row, column or entry identifiers, and we identify these cyclic permutations. As an application, we improve the previously known lower bound for the number of nonisomorphic triangulations by obtained from the voltage construction in the case when is a prime number.

Item Type: | Journal Article |
---|---|

Copyright Holders: | 2011 Combinatorial Mathematics Society of Australasia (Inc.) |

ISSN: | 1034-4942 |

Academic Unit/Department: | Mathematics, Computing and Technology > Mathematics and Statistics Mathematics, Computing and Technology |

Item ID: | 29671 |

Depositing User: | Mike Grannell |

Date Deposited: | 06 Oct 2011 08:44 |

Last Modified: | 18 Jan 2016 11:15 |

URI: | http://oro.open.ac.uk/id/eprint/29671 |

Share this page: |