Computing Planarity in Computable Planar Graphs
- 107 Downloads
A graph is computable if there is an algorithm which decides whether given vertices are adjacent. Having a procedure for deciding the edge set might not help compute other properties or features of the graph, however. The goal of this paper is to investigate the extent to which features related to the planarity of a graph might or might not be computable. We propose three definitions for what it might mean for a computable graph to be computably planar and for each build a computable planar graph which fails to be computably planar. We also consider these definitions in the context of highly computable graphs, those for which there is an algorithm which computes the degree of a given vertex.
KeywordsInfinite graphs Planar graphs Computability theory Planar embeddings
Mathematics Subject Classification05C10 05C63 03D45
The authors thank the anonymous referee for a number of helpful suggestions.
- 1.Bean, D.R.: Effective coloration. J. Symbolic Logic 41(2), 469–480 (1976)Google Scholar
- 4.Diestel, R.: Graph theory, Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2010). doi: 10.1007/978-3-642-14279-6
- 7.Gasarch, W.: A survey of recursive combinatorics. In: Handbook of Recursive Mathematics, vol. 2, Stud. Logic Found. Math., vol. 139, pp. 1041–1176. North-Holland, Amsterdam (1998). doi: 10.1016/S0049-237X(98)80049-9
- 14.Simpson, S.G.: Subsystems of second order arithmetic, 2nd edn. Perspectives in Logic. Cambridge University Press, Cambridge; Association for Symbolic Logic, Poughkeepsie (2009). doi: 10.1017/CBO9780511581007
- 15.Soare, R.I.: Recursively enumerable sets and degrees. Perspectives in Mathematical Logic. A Study of Computable Functions and Computably Generated Sets. Springer, Berlin (1987). doi: 10.1007/978-3-662-02460-7