The following pages link to (Q4028100):
Displayed 12 items.
- Coloring games on squares of graphs (Q408174) (← links)
- Adapted game colouring of graphs (Q412230) (← links)
- The relaxed game chromatic index of \(k\)-degenerate graphs (Q879391) (← links)
- Relaxed very asymmetric coloring games (Q1011775) (← links)
- Activation strategy for relaxed asymmetric coloring games (Q1025957) (← links)
- Bounded families for the on-line \(t\)-relaxed coloring (Q1044722) (← links)
- A bound for the game chromatic number of graphs (Q1297403) (← links)
- A simple competitive graph coloring algorithm. II. (Q1425110) (← links)
- A simple competitive graph coloring algorithm (Q1569067) (← links)
- Complete multipartite graphs and the relaxed coloring game (Q1757865) (← links)
- A simple competitive graph coloring algorithm. III (Q1880795) (← links)
- The strong game colouring number of directed graphs (Q1945951) (← links)