A topological space for which graph embeddability is undecidable

DOI10.1016/0095-8956(80)90092-1zbMath0461.05025OpenAlexW2089470115MaRDI QIDQ1152378

Richard Steinberg, Stephane Foldes

Publication date: 1980

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(80)90092-1

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Algorithms in computer science (68W99)

Related Items (1)

Complexity of graph embeddability problems

Cites Work

• Generalized Embedding Schemes
• Unnamed Item
• Unnamed Item

This page was built for publication: A topological space for which graph embeddability is undecidable