@MISC{Juvan_analgorithm, author = {Martin Juvan and Bojan Mohar}, title = {An algorithm for embedding graphs in the torus}, year = {} }

Bookmark

OpenURL

Abstract

An efficient algorithm for embedding graphs in the torus is presented. Given a graph G, the algorithm either returns an embedding of G in the torus or a subgraph of G which is a subdivision of a minimal nontoroidal graph. The algorithm based on [13] avoids the most complicated step of [13] by applying a recent result of Fiedler, Huneke, Richter, and Robertson [5] about the genus of graphs in the projective plane, and simplifies other steps on the expense of losing linear time complexity. 1