Pages that link to "Item:Q1305532"
From MaRDI portal
The following pages link to The game coloring number of planar graphs (Q1305532):
Displayed 18 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)
- Activation strategy for asymmetric marking games (Q925014) (← links)
- A note on the game chromatic index of graphs (Q937247) (← links)
- The 6-relaxed game chromatic number of outerplanar graphs (Q998330) (← 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)
- Relaxed game chromatic number of trees and outerplanar graphs (Q1827712) (← links)
- A simple competitive graph coloring algorithm. III (Q1880795) (← 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)
- The game of arboricity (Q2476280) (← links)
- Asymmetric marking games on line graphs (Q2477402) (← links)
- Weak acyclic coloring and asymmetric coloring games (Q2488942) (← links)
- Marking Games (Q3439438) (← links)
- Game coloring the Cartesian product of graphs (Q3605153) (← links)