An algorithm for imbedding cubic graphs in the torus
From MaRDI portal
Cites work
- A Census of Planar Maps
- A V log V algorithm for isomorphism of triconnected planar graphs
- An efficient algorithm for determining whether a cubic graph is toroidal
- An Improved Algorithm for Testing the Planarity of a Graph
- Counting rooted maps by genus. II
- Efficient Planarity Testing
- Graph theory
- scientific article; zbMATH DE number 3657692 (Why is no real title available?)
- scientific article; zbMATH DE number 3550750 (Why is no real title available?)
- scientific article; zbMATH DE number 3573250 (Why is no real title available?)
- scientific article; zbMATH DE number 3579615 (Why is no real title available?)
- scientific article; zbMATH DE number 3588683 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- scientific article; zbMATH DE number 3208815 (Why is no real title available?)
- scientific article; zbMATH DE number 3246034 (Why is no real title available?)
- scientific article; zbMATH DE number 3284075 (Why is no real title available?)
- Note on Hopcroft and Tarjan's Planarity Algorithm
- On the Complexity of Timetable and Multicommodity Flow Problems
- On the surface duality of linear graphs
- The combinatorial map color theorem
- The embeddings of a graph—A survey
Cited in
(7)- An additivity theorem for the genus of a graph
- Algorithmic graph embeddings
- Some problems in topological graph theory
- Embedding graphs in the torus in linear time
- Algorithmic graph embeddings
- Errors in graph embedding algorithms
- Determining and stationary sets for some classes of partial recursive functions
This page was built for publication: An algorithm for imbedding cubic graphs in the torus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1140090)
