Pages that link to "Item:Q1295384"
From MaRDI portal
The following pages link to On the finiteness of the recursive chromatic number (Q1295384):
Displaying 6 items.
- Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes (Q579241) (← links)
- \(A\)-computable graphs (Q904145) (← links)
- On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case (Q922525) (← links)
- On the complexity of finding the chromatic number of a recursive graph. I: The bounded case (Q1825865) (← links)
- Reflection on the coloring and chromatic numbers (Q2416518) (← links)
- Chromatic numbers of Cayley graphs on \(\mathbb Z\) and recurrence (Q5955196) (← links)