The general position avoidance game and hardness of general position games
From MaRDI portal
Publication:6150675
DOI10.1016/j.tcs.2023.114370arXiv2205.03526OpenAlexW4390399308MaRDI QIDQ6150675
Neethu P. K., Ullas Chandran S. V., Sandi Klavžar, Rudini Menezes Sampaio
Publication date: 9 February 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.03526
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the no-three-in-line problem on a torus
- A tree representation for \(P_ 4\)-sparse graphs
- On the complexity of some two-person perfect-information games
- On no-three-in-line problem on \(m\)-dimensional torus
- On the extremal combinatorics of the Hamming space
- On general position sets in Cartesian products
- \textsf{PSPACE}-hardness of variants of the graph coloring game
- The general position achievement game played on graphs
- PSPACE-completeness of two graph coloring games
- The general position number of Cartesian products involving a factor with small diameter
- A Steiner general position problem in graph theory
- The general position problem and strong resolving graphs
- Characterization of general position sets and its applications to cographs and bipartite graphs
- The general position number of integer lattices
- The Graph Theory General Position Problem on Some Interconnection Networks
- Finding Points in General Position
- A GENERAL POSITION PROBLEM IN GRAPH THEORY
- GEODETIC GAMES FOR GRAPHS
- Geodetic Achievement and Avoidance Games For Graphs
- Characterization of classes of graphs with large general position number
- On the general position problem on Kneser graphs
- THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES
- On the General Position Subset Selection Problem
This page was built for publication: The general position avoidance game and hardness of general position games
