\(A\)-computable graphs

DOI10.1016/j.apal.2015.11.003zbMath1403.03073OpenAlexW2222484746MaRDI QIDQ904145

Matthew Jura, Oscar Levin, Tyler Markkanen

Publication date: 12 January 2016

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2015.11.003

zbMATH Keywords

chromatic numbercomputability theoryEuler pathshighly computable graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Recursively (computably) enumerable sets and degrees (03D25) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28)

Cites Work

• Unnamed Item
• Unnamed Item
• Recursive coloration of countable graphs
• Hamiltonian paths in infinite graphs
• On the finiteness of the recursive chromatic number
• Domatic partitions of computable graphs
• The -spectrum of a linear order
• Recursive Colorings of Highly Recursive Graphs
• A minimal degree not realizing least possible jump
• Recursive Euler and Hamilton Paths
• Effective coloration
• Recursive Colorings of Graphs
• Degrees of Unsolvability. (AM-55)
• Initial segments of the degrees of unsolvability Part II: minimal degrees
• Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)

This page was built for publication: \(A\)-computable graphs