The following pages link to (Q4249728):
Displaying 18 items.
- Online coloring of bipartite graphs with and without advice (Q486981) (← links)
- An on-line competitive algorithm for coloring bipartite graphs without long induced paths (Q524365) (← links)
- Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes (Q579241) (← links)
- Online promise problems with online width metrics (Q859981) (← links)
- On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case (Q922525) (← 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)
- Non-density in punctual computability (Q2041959) (← links)
- Graphs are not universal for online computability (Q2186809) (← links)
- An On-line Competitive Algorithm for Coloring $$P_8$$-free Bipartite Graphs (Q2942656) (← links)
- Reverse Mathematics and Grundy colorings of graphs (Q3053234) (← links)
- Online Graph Coloring Against a Randomized Adversary (Q3177338) (← links)
- Randomized online graph coloring (Q4015271) (← links)
- Radius two trees specify χ‐bounded classes (Q4284098) (← links)
- Radius two trees specify χ‐bounded classes (Q4309985) (← links)
- (Q5155667) (← links)
- FOUNDATIONS OF ONLINE STRUCTURE THEORY (Q5226592) (← links)
- PUNCTUAL CATEGORICITY AND UNIVERSALITY (Q5858918) (← links)