On the clique-game
From MaRDI portal
Publication:649002
DOI10.1016/J.EJC.2011.07.005zbMATH Open1233.91048OpenAlexW1976103239MaRDI QIDQ649002FDOQ649002
Publication date: 29 November 2011
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2011.07.005
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)
Cites Work
- Paths in graphs
- Biased positional games on matroids
- Asymptotic random graph intuition for the biased connectivity game
- Planarity, Colorability, and Minor Games
- Biased Positional Games
- Combinatorial Games
- Positional games on random graphs
- The diameter game
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deterministic Graph Games and a Probabilistic Intuition
- Biased positional games and the phase transition
- Ramsey games
- A Winning Strategy for the Ramsey Graph Game
- Title not available (Why is that?)
Cited In (10)
- The Clique Corona Operation and Greedoids
- Cliques and constructors in ``Hats game. II
- Building Spanning Trees Quickly in Maker-Breaker Games
- The Random Graph Intuition for the Tournament Game
- An Achievement Game on a Cycle
- Weak and strong \(k\)-connectivity games
- A strategy for isolator in the toucher-isolator game on trees
- The toucher-isolator game
- Thresholds for the monochromatic clique transversal game
- Clique is hard on average for regular resolution
This page was built for publication: On the clique-game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q649002)