An algorithm for imbedding cubic graphs in the torus

DOI10.1016/0022-0000(80)90062-8zbMath0435.05022OpenAlexW2066615951MaRDI QIDQ1140090

I. S. Filotti

Publication date: 1980

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(80)90062-8

zbMATH Keywords

algorithmcubic graphimbeddable in the torustoroidal imbedding

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

An additivity theorem for the genus of a graph ⋮ Algorithmic graph embeddings ⋮ Embedding graphs in the torus in linear time ⋮ Errors in graph embedding algorithms ⋮ Algorithmic graph embeddings ⋮ Some problems in topological graph theory ⋮ Determining and stationary sets for some classes of partial recursive functions

Cites Work

• A V log V algorithm for isomorphism of triconnected planar graphs
• Counting rooted maps by genus. II
• An Improved Algorithm for Testing the Planarity of a Graph
• Efficient Planarity Testing
• Note on Hopcroft and Tarjan's Planarity Algorithm
• On the Complexity of Timetable and Multicommodity Flow Problems
• The combinatorial map color theorem
• The embeddings of a graph—A survey
• On the surface duality of linear graphs
• An efficient algorithm for determining whether a cubic graph is toroidal
• A Census of Planar Maps
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item