Balint A.,A. A.,Strichman A. .2010 .Fro¨hlich, Improving stochastic local search for SAT with a new probability distribution. SAT 2010: 13th International Conference on Theory and Applications of Satisfiability Testing, 15 8 13 16 5 2 14 8 9 6 5 0 3 4(a) : 10-15.
Biere A.,Faller T.,Fazekas K.,Fleury M.,Froleyks N.,Pollitt F.,Gurfinkel F. .2024 .. CAV, 2 : 133-152.
Biere A.,Heule M.,H. van Maaren M. .2009 .. Handbook of Satisfiability, : .
Bowtell C.,Keevash P. .2021 .The n-queens problem. arXiv:2109.08083, : .
Cockayne E.,Hedetniemi S. .1975 .Optimal domination in graphs. IEEE Trans. Circ. Syst, 22(11) : 855-857.
Hedetniemi J. T.,Hedetniemi K. D.,Hedetniemi S. M.,Hedetniemi S. T. .2024 .On the domatic numbers of queens graphs. Congr. Numer, 235 : 5-21.
Heggernes P.,Telle J. A. .1998 .Partitioning graphs into generalized dominating sets. Nord. J. Comput, 5(2) : 128-142.
Ignatiev A.,Morgado A.,Beyersdorf A.,C. M. Wintersteiger A. .2018 .PySAT: A Python toolkit for prototyping with SAT oracles. SAT 2018: 21st International Conference on Theory and Applications of Satisfiability Testing, : 428-437.
Ignatiev A.,Tan Z. L.,Karamanos C. .2024 .Towards universally accessible SAT technology. SAT 2024: 27th International Conference on Theory and Applications of Satisfiability Testing, 16 : 11-16.
Sinz C. .2005 .Towards an optimal CNF encoding of boolean cardinality constraints. CP 2005: 11th International Conference on Principles and Practice of Constraint Programming, : 827-831.
Vasquez M. .2004 .New results on the Queensn2 graph coloring problem. J. Heuristics, 10(4) : 407-413.
Vasquez M.,Habet D.,de M a D. .2004 .´ntaras. ECAI 2004: 16th European Conference on Artificial Intelligence, : 226-230.
Vasquez M.,Vimont Y.,Brankovic J.,Ryan W. F.,Smyth W. F. .2017 .On solving the queen graph coloring problem. IWOCA 2017: 28th International Workshop on Combinatorial Algorithms, : 244-251.
Zelinka B.,Hedetniemi S. T.,Slater S. T. .2017 .Domatic numbers of graphs and their variants: a survey. , : 351-378.