Cookies?
Library Header Image
LSE Research Online LSE Library Services

A topological space for which graph embeddability is undecidable

Foldes, Stephane and Steinberg, Richard (1980) A topological space for which graph embeddability is undecidable. Journal of Combinatorial Theory, Series B, 29 (3). pp. 342-344. ISSN 0095-8956

Full text not available from this repository.

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.
Subjects: Q Science > QA Mathematics
Sets: Research centres and groups > Management Science Group
Departments > Management
Date Deposited: 16 Apr 2009 09:32
Last Modified: 02 Dec 2013 12:32
URI: http://eprints.lse.ac.uk/id/eprint/23599

Actions (login required)

View Item View Item