An efficient algorithm for determining whether a cubic graph is toroidal
From MaRDI portal
Publication:5402550
DOI10.1145/800133.804341zbMath1282.68180OpenAlexW2063967407MaRDI QIDQ5402550
Publication date: 14 March 2014
Published in: Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/800133.804341
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
An algorithm for imbedding cubic graphs in the torus ⋮ Errors in graph embedding algorithms ⋮ Some problems in topological graph theory
