The following pages link to Recursive Colorings of Graphs (Q4175305):
Displayed 13 items.
- Computing planarity in computable planar graphs (Q503647) (← links)
- Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes (Q579241) (← links)
- Some undecidable problems involving the edge-coloring and vertex-coloring of graphs (Q801935) (← links)
- Finding domatic partitions in infinite graphs (Q888598) (← 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 strength of König's duality theorem for infinite bipartite graphs (Q1193566) (← links)
- On the finiteness of the recursive chromatic number (Q1295384) (← links)
- On the complexity of finding the chromatic number of a recursive graph. I: The bounded case (Q1825865) (← links)
- R.e. Prime powers and total rigidity (Q2281321) (← links)
- Reverse Mathematics and Recursive Graph Theory (Q4224080) (← links)
- Feasible Graphs and Colorings (Q4844508) (← links)
- Primitive recursive reverse mathematics (Q6050165) (← links)