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

Copy

There exists a path-connected subspace of the plane for which graph embeddability is undecidable.

Item Type	Article
Copyright holders	© 1980 Elsevier B.V.
Departments	Management
Date Deposited	16 Apr 2009 09:32
URI	https://researchonline.lse.ac.uk/id/eprint/23599

Explore Further

Foldes, Stephane
Steinberg, Richard

QA Mathematics

http://www.elsevier.com/wps/find/journaldescriptio... (Official URL)

Full text not available from this repository.

Atom

BibTeX

OpenURL ContextObject in Span

OpenURL ContextObject

Dublin Core

MPEG-21 DIDL

Data Cite XML

EndNote

HTML Citation

METS

MODS

RIOXX2 XML

Reference Manager

Refer

ASCII Citation

Export

Downloads