The following pages link to Very asymmetric marking games (Q2490427):
Displaying 22 items.
- Asymmetric coloring games on incomparability graphs (Q324375) (← links)
- Coloring games on squares of graphs (Q408174) (← links)
- Activation strategy for asymmetric marking games (Q925014) (← links)
- Relaxed very asymmetric coloring games (Q1011775) (← links)
- Colouring games on outerplanar graphs and trees (Q1025941) (← links)
- Activation strategy for relaxed asymmetric coloring games (Q1025957) (← links)
- Circular game chromatic number of graphs (Q1043981) (← links)
- The game coloring number of planar graphs with a specific girth (Q1743687) (← links)
- The strong game colouring number of directed graphs (Q1945951) (← links)
- The game Grundy number of graphs (Q1956234) (← links)
- The game coloring number of planar graphs with a given girth (Q2017053) (← links)
- On coloring numbers of graph powers (Q2174571) (← links)
- A connected version of the graph coloring game (Q2192130) (← links)
- Uniform orderings for generalized coloring numbers (Q2225419) (← 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)
- On a vertex-edge marking game on graphs (Q2660140) (← links)
- Strong Chromatic Index of Sparse Graphs (Q2833251) (← links)
- Game coloring the Cartesian product of graphs (Q3605153) (← links)
- Game chromatic number of toroidal grids (Q5891223) (← links)
- Game chromatic number of toroidal grids (Q5901168) (← links)
