On bichromatic triangle game
From MaRDI portal
Publication:2448874
DOI10.1016/J.DAM.2012.08.033zbMATH Open1286.91031OpenAlexW2018285126MaRDI QIDQ2448874FDOQ2448874
Miloš Stojaković, Daniel Martin, Gordana Manić
Publication date: 5 May 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.08.033
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Games involving graphs (91A43) Combinatorial games (91A46)
Cites Work
Cited In (7)
- The first player wins the one-colour triangle avoidance game on 16 vertices
- Title not available (Why is that?)
- On Hajnal's triangle-free game
- Bichromatic triangle games
- How to play the triangle game
- A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals
- Games on triangulations
This page was built for publication: On bichromatic triangle game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448874)