Recursive Colorings of Highly Recursive Graphs
From MaRDI portal
Publication:3907590
DOI10.4153/CJM-1981-097-8zbMath0458.05034MaRDI QIDQ3907590
Publication date: 1981
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C75: Structural characterization of families of graphs
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, \(A\)-computable graphs, On the complexity of finding the chromatic number of a recursive graph. I: The bounded case