Complexity of graph embeddability problems

DOI10.1016/0304-3975(81)90085-2zbMath0459.68027MaRDI QIDQ1152224

S. H. Smith

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(81)90085-2

zbMATH Keywords

time complexity; planar graph; combinatorial embeddability in infinite graphs

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

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