Grannell, M. J. and Knor, M.
|DOI (Digital Object Identifier) Link:||http://dx.doi.org/10.1002/jgt.20590|
|Google Scholar:||Look up in Google Scholar|
We prove that for every prime number and odd , as , there are at least face 2-colourable triangular embeddings of , where . For both orientable and nonorientable embeddings, this result implies that for infinitely many infinite families of , there is a constant for which there are at least nonisomorphic face 2-colourable triangular embeddings of .
|Item Type:||Journal Article|
|Copyright Holders:||2011 Wiley Periodicals, Inc.|
|Keywords:||triangular embedding; Latin square; complete graph; complete tripartite graph|
|Academic Unit/Department:||Mathematics, Computing and Technology > Mathematics and Statistics
Mathematics, Computing and Technology
|Depositing User:||Mike Grannell|
|Date Deposited:||18 Sep 2012 14:11|
|Last Modified:||18 Jan 2016 15:39|
|Share this page:|