Computing planarity in computable planar graphs

DOI10.1007/S00373-016-1725-8zbMath1353.05041OpenAlexW2473481609MaRDI QIDQ503647

Taylor McMillan, Oscar Levin

Publication date: 13 January 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://digscholarship.unco.edu/urj/vol6/iss1/2

zbMATH Keywords

planar graphscomputability theoryinfinite graphsplanar embeddings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Theory of numerations, effectively presented structures (03D45) Infinite graphs (05C63)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive coloration of countable graphs
• Hamiltonian paths in infinite graphs
• Domatic partitions of computable graphs
• A Separator Theorem for Planar Graphs
• Recursive Colorings of Highly Recursive Graphs
• Recursive Euler and Hamilton Paths
• Effective coloration
• Straight Line Representations of Infinite Planar Graphs
• Recursive Colorings of Graphs
• Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)
• Some Remarks on Set Theory

This page was built for publication: Computing planarity in computable planar graphs