Recursive Colorings of Graphs
From MaRDI portal
Publication:4175305
DOI10.4153/CJM-1980-062-7zbMath0394.05021MaRDI QIDQ4175305
Publication date: 1980
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
05C15: Coloring of graphs and hypergraphs
Related Items
Feasible Graphs and Colorings, Computing planarity in computable planar graphs, Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes, Some undecidable problems involving the edge-coloring and vertex-coloring of graphs, Finding domatic partitions in infinite graphs, \(A\)-computable graphs, On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case, On the strength of König's duality theorem for infinite bipartite graphs, On the finiteness of the recursive chromatic number, On the complexity of finding the chromatic number of a recursive graph. I: The bounded case, Reverse Mathematics and Recursive Graph Theory