The following pages link to (Q2712591):
Displayed 17 items.
- Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers (Q819816) (← links)
- Generalised game colouring of graphs (Q878606) (← links)
- The relaxed game chromatic index of \(k\)-degenerate graphs (Q879391) (← links)
- A note on the game chromatic index of graphs (Q937247) (← links)
- Game chromatic index of graphs with given restrictions on degrees (Q954995) (← links)
- The 6-relaxed game chromatic number of outerplanar graphs (Q998330) (← links)
- Game-perfect graphs (Q1014302) (← links)
- A simple competitive graph coloring algorithm. II. (Q1425110) (← links)
- Relaxed game chromatic number of trees and outerplanar graphs (Q1827712) (← links)
- Note on the game chromatic index of trees (Q1884997) (← links)
- Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs (Q2427530) (← links)
- Refined activation strategy for the marking game (Q2464148) (← links)
- Asymmetric marking games on line graphs (Q2477402) (← links)
- The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\) (Q2492207) (← links)
- (Q5708524) (← links)
- The incidence game chromatic number (Q5899386) (← links)
- The incidence game chromatic number (Q5902114) (← links)