Recursive Colorings of Highly Recursive Graphs
From MaRDI portal
Publication:3907590
DOI10.4153/CJM-1981-097-8zbMath0458.05034OpenAlexW2326563584MaRDI QIDQ3907590
Publication date: 1981
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1981-097-8
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items
Feasible Graphs and Colorings ⋮ \(A\)-computable graphs ⋮ Computing planarity in computable planar graphs ⋮ Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes ⋮ On the complexity of finding the chromatic number of a recursive graph. I: The bounded case