The combinatorial game \textsc{Nofil} played on Steiner triple systems
From MaRDI portal
Publication:6562275
DOI10.1002/JCD.21809zbMATH Open1542.05114MaRDI QIDQ6562275FDOQ6562275
Authors: Melissa Huggan, Svenja Huntemann, Brett Stevens 
Publication date: 26 June 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Triple systems (05B07)
Cites Work
- The CRC handbook of combinatorial designs
- Title not available (Why is that?)
- Hardness vs randomness
- Combinatorial game theory
- Edge-decompositions of graphs with high minimum degree
- Title not available (Why is that?)
- On the complexity of approximating the independent set problem
- On the complexity of some two-person perfect-information games
- Playing games with algorithms: algorithmic combinatorial game theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cops and robbers on graphs based on designs
- Projective geometry. An introduction
- Compound Node-Kayles on paths
- Exact Algorithms for Kayles
- Kayles and Nimbers
- Almost All Steiner Triple Systems Are Asymmetric
- Title not available (Why is that?)
- Tic-tac-toe on a finite plane
- Title not available (Why is that?)
- Nim, a game with a complete mathematical theory.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Über zwei Abarten von Nim.
- The localization number of designs
This page was built for publication: The combinatorial game \textsc{Nofil} played on Steiner triple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562275)
