998
Views
0
CrossRef citations to date
0
Altmetric
Research Articles

Sudoku number of graphs

, , &
Pages 209-216 | Received 23 Jan 2023, Accepted 13 Feb 2023, Published online: 16 Jun 2023

References

  • Bondy, J. A., Murty, U. S. R. (1976). Graph Theory with Applications. New York: MacMillan.
  • Cooper, J., Kirkpatrick, A. (2014). Critial sets for Sudoku and general graph colorings. Discrete Math. 315–316: 112–119.
  • Dalley, D. P. (1980). Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. Discrete Math. 30: 289–293.
  • Erdős, P., Rubin, A. L., Taylor, H. (1979). Choosability in graphs. Congr. Numer. 26: 125–157.
  • Garey, M. R., Johnson, D. S., Stockmeyer, L. (1976). Some simplified NP-complete graph problems. Theor. Comput. Sci. 1: 237–267.
  • Grötzsch, H. (1958–9). Zur Theorie der diskreten Gebilde VII. Ein Dreifarbensatz für dreikreisfrei Netze auf der Kugel. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe. 8: 109–120.
  • Grötzsch, H. Proper Sudoku with only 17 clues (49 Book series), Kindle Edition.
  • McGuire, G., Tugemann, B., Civario, G. (2014). There is no 16-clue Sudoku: Solving the Sudoku minimum number of clues problem via hitting set enumeration. Exp. Math. 23(2): 190–217.
  • Vizing, V. G. (1976). Vertex colorings with given colors. Metody Diskret. Analiz. 29: 3–10 (in Russian).