Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments
Vladimir P. Korzhik · Journal of Graph Theory · 2009
Abstract It is known that for all sufficiently large s, there are at least \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}$(\frac{5}{3})$\end{document} 2s nonequivalent graceful labellings of the path on 2s + 1 vertices. Using this result, we construct exponentially many index one current graphs with current group ℤ12s + 7 such that many of the current graphs have different underlying graphs. The constructed current graphs for all sufficiently large sgenerate at least 30s nonisomorphic triangular embeddings of K12s + 7. © 2009 Wiley Periodicals, Inc. J Graph Theory 61: 324–334, 2009