On the undecidability of finite planar graphs

&
Journal of Symbolic Logic 36 (1):121-126 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271520

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Forbidden subgraphs and forbidden substructures.Gregory Cherlin & Niandong Shi - 2001 - Journal of Symbolic Logic 66 (3):1342-1352.
Hereditary undecidability of some theories of finite structures.Ross Willard - 1994 - Journal of Symbolic Logic 59 (4):1254-1262.
Reachability is harder for directed than for undirected finite graphs.Miklos Ajtai & Ronald Fagin - 1990 - Journal of Symbolic Logic 55 (1):113-150.
Effective coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.
Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
On the expressiveness of frame satisfiability and fragments of second-order logic.Thomas Eiter & Georg Gottlob - 1998 - Journal of Symbolic Logic 63 (1):73-82.
A construction of superstable NDOP-NOTOP groups.Andreas Baudisch - 1991 - Journal of Symbolic Logic 56 (4):1385-1390.
Finitely constrained classes of homogeneous directed graphs.Brenda J. Latka - 1994 - Journal of Symbolic Logic 59 (1):124-139.
Two variable first-order logic over ordered domains.Martin Otto - 2001 - Journal of Symbolic Logic 66 (2):685-702.
On the undecidability of finite planar cubic graphs.Solomon Garfunkel & Herbert Shank - 1972 - Journal of Symbolic Logic 37 (3):595-597.

Analytics

Added to PP
2009-01-28

Downloads
212 (#90,657)

6 months
5 (#544,079)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references