A topological space for which graph embeddability is undecidable

Foldes, S. & Steinberg, R.

(1980). A topological space for which graph embeddability is undecidable. Journal of Combinatorial Theory, Series B, 29(3), 342-344.

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	LSE > Academic Departments > Management
Date Deposited	16 Apr 2009
URI	https://researchonline.lse.ac.uk/id/eprint/23599

Full text not available from this repository.

Downloads

View more statistics