20.500.12556/DKUM-87937 General Position Sets in Two Families of Cartesian Product Graphs For 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. general position set cartesian product hypercube SAT grafi matematika kartezični produkt hiperkocka true false true Springer (Birkhäuser) Angleški jezik Slovenski jezik https://link.springer.com/journal/9 Članek v reviji 2024-04-02 13:12:29 2024-04-02 13:28:05 2024-05-23 08:14:06 0000-00-00 00:00:00 2023 0 0 Str. 1-12 Št. članka 203 Letn. 20 Published 06 May 2023 0000-00-00 Zaloznikova Objavljeno NiDoloceno 2022-04-03 2023-04-20 2023-05-06 519.1 151233539 10.1007/s00009-023-02416-z 1660-5446 Korze-2023-General_Position_Sets_in_Two_Famili.pdf Korze-2023-General_Position_Sets_in_Two_Famili.pdf 1 7037A5A450BA17DFA22D9E484284C466 50dc47db5c0185dda43c78f062cff4fc88b53b772953ba36dc984da3e41cbde5 d40c20da-f0e3-11ee-9041-00155d000105 https://dk.um.si/Dokument.php?lang=slv&id=177767 https://link.springer.com/article/10.1007/s00009-023-02416-z 0 f488c550-f0e3-11ee-9041-00155d000105 https://dk.um.si/Dokument.php?lang=slv&id=177768 Fakulteta za elektrotehniko, računalništvo in informatiko Fakulteta za naravoslovje in matematiko 0 0 0