{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T02:26:15Z","timestamp":1769307975761,"version":"3.49.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T00:00:00Z","timestamp":1764288000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T00:00:00Z","timestamp":1764288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s00224-025-10250-x","type":"journal-article","created":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T15:33:53Z","timestamp":1764344033000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Unveiling Order in Chaos: A Systematic Approach Based on Graph Theory in Enumerating Sudoku Grids of Rank n"],"prefix":"10.1007","volume":"69","author":[{"given":"Pallavi","family":"Mishra","sequence":"first","affiliation":[]},{"given":"Rachna","family":"Bhatia","sequence":"additional","affiliation":[]},{"given":"Predrag S.","family":"Stanimirovi\u0107","sequence":"additional","affiliation":[]},{"given":"D. K.","family":"Gupta","sequence":"additional","affiliation":[]},{"given":"Rakesh P.","family":"Badoni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,28]]},"reference":[{"issue":"5","key":"10250_CR1","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1080\/00029890.2008.11920542","volume":"115","author":"RA Bailey","year":"2008","unstructured":"Bailey, R.A., Cameron, P.J., Connelly, R.: Sudoku, gerechte designs, resolutions, affine space, spreads, reguli, and Hamming codes. Am. Math. Monthly 115(5), 383\u2013404 (2008)","journal-title":"Am. Math. Monthly"},{"key":"10250_CR2","first-page":"176","volume":"2","author":"WU Behrens","year":"1956","unstructured":"Behrens, W.U.: Feldversuchsanordnungen mit verbessertem Ausgleich der Bodenunterschiede. Zeitschrift f\u00fcr Landwirtschaftliches Versuchsund Untersuchungswesen 2, 176\u2013193 (1956)","journal-title":"Zeitschrift f\u00fcr Landwirtschaftliches Versuchsund Untersuchungswesen"},{"issue":"12","key":"10250_CR3","doi-asserted-by":"publisher","first-page":"3697","DOI":"10.1016\/j.jspi.2011.06.001","volume":"141","author":"R Fontana","year":"2011","unstructured":"Fontana, R.: Fractions of permutations: an application to sudoku. J. Stat. Plan. Inference 141(12), 3697\u20133704 (2011)","journal-title":"J. Stat. Plan. Inference"},{"issue":"9","key":"10250_CR4","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosh, J.: Algorithm 457: Finding all Cliques of an Undirected Graph. Commun. ACM 16(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"issue":"6","key":"10250_CR5","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.orl.2004.03.002","volume":"32","author":"JM Byskov","year":"2004","unstructured":"Byskov, J.M.: Enumerating maximal independent sets with applications to graph colouring. Operations Res. Lett. 32(6), 547\u2013556 (2004)","journal-title":"Operations Res. Lett."},{"key":"10250_CR6","doi-asserted-by":"crossref","unstructured":"Ciantar, K.G., Casha, O.: Implementation of a Sudoku Puzzle Solver on a FPGA. In: 2023 9th International Conference on Control, Decision and Information Technologies (CoDIT) pp. 1803\u20131808 IEEE (2023)","DOI":"10.1109\/CoDIT58514.2023.10284457"},{"issue":"1","key":"10250_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0166-218X(84)90075-1","volume":"8","author":"CJ Colbourn","year":"1984","unstructured":"Colbourn, C.J.: The complexity of completing partial Latin squares. Discrete Appl. Math. 8(1), 25\u201330 (1984)","journal-title":"Discrete Appl. Math."},{"issue":"8","key":"10250_CR8","doi-asserted-by":"publisher","first-page":"2457","DOI":"10.1016\/j.laa.2008.12.023","volume":"430","author":"G Dahl","year":"2009","unstructured":"Dahl, G.: Permutation matrices related to Sudoku. Linear Algebra Appl. 430(8), 2457\u20132463 (2009)","journal-title":"Linear Algebra Appl."},{"key":"10250_CR9","doi-asserted-by":"crossref","unstructured":"Du, H., Gao, L., Hu, X.: A $$4 \\times 4$$ Sudoku Solving Model Based on Multi-layer Perceptron. In: 2021 International Conference on Electronic Information Engineering and Computer Science (EIECS) pp. 306\u2013310 IEEE (2021)","DOI":"10.1109\/EIECS53707.2021.9587969"},{"key":"10250_CR10","unstructured":"Eppstein, D.: Nonrepetitive paths and cycles in graphs with application to Sudoku, arXiv:cs\/0507053 (2005)"},{"key":"10250_CR11","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. Int. Symposium Experimental Algorithms 364\u2013375 (2011)","DOI":"10.1007\/978-3-642-20662-7_31"},{"key":"10250_CR12","series-title":"LNCS","first-page":"403","volume-title":"ISAAC 2010","author":"D Eppstein","year":"2010","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in sparse graphs in near-optimal time. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6506, pp. 403\u2013414. Springer, Heidelberg (2010)"},{"issue":"40","key":"10250_CR13","first-page":"46","volume":"181","author":"O Eva","year":"2019","unstructured":"Eva, O., Dunka, B.: A Comparison of Three Sudoku Solving Methods. Int. J. Comput. Appl. 181(40), 46\u201352 (2019)","journal-title":"Int. J. Comput. Appl."},{"key":"10250_CR14","unstructured":"Felgenhauer, B., Jarvis, F.: Enumerating possible Sudoku grids, Mathematical Spectrum, Available at http:\/\/www.afjarvis.staff.shef.ac.uk\/sudoku\/sudoku.pdf (2005)"},{"issue":"6","key":"10250_CR15","first-page":"708","volume":"54","author":"AM Herzberg","year":"2007","unstructured":"Herzberg, A.M., Murty, M.R.: Sudoku squares and chromatic polynomials. Notices AMS 54(6), 708\u2013717 (2007)","journal-title":"Notices AMS"},{"key":"10250_CR16","doi-asserted-by":"crossref","unstructured":"Maji, A.K., Pal, R.K., Roy, S.: A novel steganographic scheme using Sudoku. International Conference on Electrical Information and Communication Technology (EICT), IEEE (2014)","DOI":"10.1109\/EICT.2014.6777849"},{"key":"10250_CR17","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.protcy.2013.12.375","volume":"10","author":"AK Maji","year":"2013","unstructured":"Maji, A.K., Jana, S., Pal, R.K.: An algorithm for generating only desired permutations for solving sudoku puzzle. Procedia Technol. 10, 392\u2013399 (2013)","journal-title":"Procedia Technol."},{"key":"10250_CR18","doi-asserted-by":"crossref","unstructured":"J. Maria Jeyaseeli, G. C. Lau, W. C. Shiu, & S. Arumugam, Sudoku number of graphs, AKCE International Journal of Graphs and Combinatorics, 20(2) (2023), 209\u2013216","DOI":"10.1080\/09728600.2023.2218917"},{"issue":"2","key":"10250_CR19","doi-asserted-by":"publisher","first-page":"1650026","DOI":"10.1142\/S1793830916500269","volume":"8","author":"P Mishra","year":"2016","unstructured":"Mishra, P., Gupta, D.K., Badoni, R.P.: A new algorithm for enumerating all possible Sudoku squares. Discrete Math. Algorithms Appl. 8(2), 1650026 (2016)","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"1","key":"10250_CR20","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s13748-023-00297-7","volume":"12","author":"N Pathak","year":"2023","unstructured":"Pathak, N., Kumar, R.: Entropy guided evolutionary search for solving Sudoku. Progress Artif. Intell. 12(1), 61\u201376 (2023)","journal-title":"Progress Artif. Intell."},{"issue":"1","key":"10250_CR21","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s00013-023-01859-w","volume":"121","author":"B Sambale","year":"2023","unstructured":"Sambale, B.: Character table sudokus. Arch. Math. 121(1), 23\u201332 (2023)","journal-title":"Arch. Math."},{"issue":"1","key":"10250_CR22","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0012-365X(92)90722-R","volume":"110","author":"J Shao","year":"1992","unstructured":"Shao, J., Wei, W.: A formula for the number of Latin squares. Discrete Math. 110(1), 293\u2013296 (1992)","journal-title":"Discrete Math."},{"issue":"1","key":"10250_CR23","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theoretical Comput. Sci. 363(1), 28\u201342 (2006)","journal-title":"Theoretical Comput. Sci."},{"key":"10250_CR24","doi-asserted-by":"crossref","unstructured":"Wu, Y., Noonan, J.P., Agaian, S.: Image encryption using the rectangular sudoku cipher. International Conference on System Science and Engineering (ICSSE), IEEE (2011)","DOI":"10.1109\/ICSSE.2011.5961994"},{"issue":"18","key":"10250_CR25","doi-asserted-by":"publisher","first-page":"3072","DOI":"10.1016\/j.dam.2013.06.007","volume":"161","author":"K Yordzhev","year":"2013","unstructured":"Yordzhev, K.: On the number of disjoint pairs of s-permutation matrices. Discrete Appl. Math. 161(18), 3072\u20133079 (2013)","journal-title":"Discrete Appl. Math."},{"key":"10250_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.amc.2015.06.054","volume":"268","author":"K Yordzhev","year":"2015","unstructured":"Yordzhev, K.: Calculation of the number of all pairs of disjoint S-permutation matrices. Appl. Math. Comput. 268, 1\u201311 (2015)","journal-title":"Appl. Math. Comput."},{"issue":"6","key":"10250_CR27","doi-asserted-by":"publisher","first-page":"1442","DOI":"10.1016\/j.disc.2016.09.011","volume":"340","author":"K Yordzhev","year":"2017","unstructured":"Yordzhev, K.: On the number of mutually disjoint pairs of S-permutation matrices. Discrete Math. 340(6), 1442\u20131448 (2017)","journal-title":"Discrete Math."},{"key":"10250_CR28","unstructured":"Yordzhev, K.: Sudoku, S-permutation matrices and bipartite graphs, LAP LAMBERT Academic Publishing, ISBN: 978-3659974724 (2016)"},{"key":"10250_CR29","doi-asserted-by":"crossref","unstructured":"Yordzhev, K.: Bipartite graphs related to mutually disjoint s-permutation matrices. ISRN Discrete Mathematics 2012, Article ID 384068, 18 pages (2012)","DOI":"10.5402\/2012\/384068"},{"key":"10250_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.enconman.2022.116105","volume":"269","author":"D Yousri","year":"2022","unstructured":"Yousri, D., Fathy, A., El-Saadany, E.F.: Four square sudoku approach for alleviating shading effect on total-cross-tied PV array. Energy Conversion Manag. 269, 116105 (2022)","journal-title":"Energy Conversion Manag."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-025-10250-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-025-10250-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-025-10250-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T08:52:47Z","timestamp":1769244767000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-025-10250-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,28]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["10250"],"URL":"https:\/\/doi.org\/10.1007\/s00224-025-10250-x","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,28]]},"assertion":[{"value":"29 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"40"}}