Recommendations
Cited in
(30)- How long can a graph be kept planar?
- On the odd cycle game and connected rules
- Monotonic stable solutions for minimum coloring games
- Keeping avoider's graph almost acyclic
- On the separation conjecture in avoider-enforcer games
- The toucher-isolator game
- Game matching number of graphs
- Fast winning strategies in maker-breaker games
- A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals
- Waiter-Client and Client-Waiter planarity, colorability and minor games
- Avoider-Enforcer: the rules of the game
- Sharp thresholds for half-random games. I.
- The diameter game
- scientific article; zbMATH DE number 4200245 (Why is no real title available?)
- Fast winning strategies in positional games
- Avoider-forcer games on hypergraphs with small rank
- The topology of competitively constructed graphs
- Finding and using expanders in locally sparse graphs
- Playing to retain the advantage
- The Game Saturation Number of a Graph
- The random graph intuition for the tournament game
- Maker-Breaker total domination game on cubic graphs
- The Kℵ0$K^{\aleph _0}$ game: Vertex colouring
- Multistage positional games
- On monotonicity in maker-breaker graph colouring games
- On the clique-game
- The \((a, b)\)-monochromatic transversal game on clique-hypergraphs of powers of cycles
- The picker-chooser diameter game
- Fast winning strategies in avoider-enforcer games
- Avoider-enforcer: the rules of the game
This page was built for publication: Planarity, Colorability, and Minor Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3614201)
