Foldes, Stephane and Steinberg, Richard 
ORCID: 0000-0001-9636-472X
(1980)
A topological space for which graph embeddability is undecidable.
Journal of Combinatorial Theory, Series B, 29 (3).
pp. 342-344.
ISSN 0095-8956
Abstract
There exists a path-connected subspace of the plane for which graph embeddability is undecidable.
| Item Type: | Article |
|---|---|
| Official URL: | http://www.elsevier.com/wps/find/journaldescriptio... |
| Additional Information: | © 1980 Elsevier B.V. |
| Divisions: | Management |
| Subjects: | Q Science > QA Mathematics |
| Date Deposited: | 16 Apr 2009 09:32 |
| Last Modified: | 13 Sep 2024 20:51 |
| URI: | http://eprints.lse.ac.uk/id/eprint/23599 |
Actions (login required)
 |
View Item |
