An algorithm for imbedding cubic graphs in the torus
作者：
Highlights：
•
摘要
An algorithm is presented for determining whether a cubic graph (i.e., every vertex of which has valence 3) can be imbedded in the torus. An imbedding is produced in the affirmative. The algorithm has running time bounded by a polynomial in the number of vertices of the graph.
论文关键词：
论文评审过程：Received 4 January 1979, Revised 20 January 1980, Available online 2 December 2003.
论文官网地址：https://doi.org/10.1016/0022-0000(80)90062-8
