General Position Sets in Two Families of Cartesian Product GraphsKorže, Danilo (Avtor) Vesel, Aleksander (Avtor) general position setcartesian producthypercubeSATFor a given graph G, the general position problem asks for the largest set of vertices S⊆V(G) , such that no three distinct vertices of S belong to a common shortest path of G. The general position problem for Cartesian products of two cycles as well as for hypercubes is considered. The problem is completely solved for the first family of graphs, while for the hypercubes, some partial results based on reduction to SAT are given.Springer (Birkhäuser)20232024-04-02 13:12:29Članek v reviji87937UDK: 519.1COBISS_ID: 151233539DOI: 10.1007/s00009-023-02416-zISSN pri članku: 1660-5446sl