Recursive Colorings of Graphs
From MaRDI portal
Publication:4175305
DOI10.4153/CJM-1980-062-7zbMath0394.05021OpenAlexW2321852024MaRDI QIDQ4175305
Publication date: 1980
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1980-062-7
Related Items
Feasible Graphs and Colorings ⋮ Finding domatic partitions in infinite graphs ⋮ Primitive recursive reverse mathematics ⋮ \(A\)-computable graphs ⋮ On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case ⋮ Computing planarity in computable planar graphs ⋮ On the strength of König's duality theorem for infinite bipartite graphs ⋮ Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes ⋮ R.e. Prime powers and total rigidity ⋮ On the complexity of finding the chromatic number of a recursive graph. I: The bounded case ⋮ On the finiteness of the recursive chromatic number ⋮ Reverse Mathematics and Recursive Graph Theory ⋮ Some undecidable problems involving the edge-coloring and vertex-coloring of graphs