On the finiteness of the recursive chromatic number

DOI10.1016/S0168-0072(98)00054-2zbMath0937.03054OpenAlexW2021533317MaRDI QIDQ1295384

William I. Gasarch, Andrew C. Y. Lee

Publication date: 29 May 2000

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

Full work available at URL: https://doi.org/10.1016/s0168-0072(98)00054-2

zbMATH Keywords

recursive graphhighly recursive graphrecursive coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Related Items (1)

\(A\)-computable graphs

Cites Work

• Recursive coloration of countable graphs
• On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
• Effective coloration
• Recursive Colorings of Graphs
• Recursively enumerable sets and degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the finiteness of the recursive chromatic number