{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:15Z","timestamp":1771036335892,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032046994","type":"print"},{"value":"9783032047007","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-04700-7_18","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:45Z","timestamp":1758498345000},"page":"238-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hardness of\u00a0Pre-assignment Problem for\u00a0Unique Minimum Vertex Cover on\u00a0Planar Graphs with\u00a0Maximum Degree\u00a03"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9451-259X","authenticated-orcid":false,"given":"Takashi","family":"Horiyama","sequence":"first","affiliation":[]},{"given":"Fumiya","family":"Sakamoto","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9043-7019","authenticated-orcid":false,"given":"Kazuhisa","family":"Seto","sequence":"additional","affiliation":[]},{"given":"Ryu","family":"Suzuki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"key":"18_CR1","first-page":"147","volume":"30","author":"P Afshani","year":"2004","unstructured":"Afshani, P., Hatami, H., Mahmoodian, E.S.: On the spectrum of the forced matching number of graphs. Australas. J Comb. 30, 147\u2013160 (2004)","journal-title":"Australas. J Comb."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"An, S., et al.: Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs. In: Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, AAAI 2025, pp. 26886\u201326894 (2025)","DOI":"10.1609\/aaai.v39i25.34893"},{"issue":"4","key":"18_CR3","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.29020\/nybg.ejpam.v12i4.3484","volume":"12","author":"CL Armada","year":"2019","unstructured":"Armada, C.L., Canoy, S.R., Jr.: Forcing independent domination number of a graph. Eur. J. Pure Appl. Math. 12(4), 1371\u20131381 (2019)","journal-title":"Eur. J. Pure Appl. Math."},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/3-540-45793-3_27","volume-title":"Computer Science Logic","author":"R Barbanchon","year":"2002","unstructured":"Barbanchon, R., Grandjean, E.: Local problems, planar local problems and linear time. In: Bradfield, J. (ed.) CSL 2002. LNCS, vol. 2471, pp. 397\u2013411. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45793-3_27"},{"key":"18_CR5","first-page":"161","volume":"25","author":"G Chartrand","year":"1997","unstructured":"Chartrand, G., Gavlas, H., Vandell, R.C., Harary, F.: The forcing domination number of a graph. J. Comb. Math. Comb. Comput. 25, 161\u2013174 (1997)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"18_CR6","first-page":"33","volume":"12","author":"J Cooper","year":"1994","unstructured":"Cooper, J., Donovan, D., Seberry, J.: Secret sharing schemes arising from Latin squares. Bull. Inst. Combin. Appl. 12, 33\u201343 (1994)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.disc.2013.10.011","volume":"315\u2013316","author":"J Cooper","year":"2014","unstructured":"Cooper, J., Kirkpatrick, A.: Critical sets for sudoku and general graph colorings. Discret. Math. 315\u2013316, 112\u2013119 (2014)","journal-title":"Discret. Math."},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2018.01.020","volume":"748","author":"ED Demaine","year":"2018","unstructured":"Demaine, E.D., Ma, F., Schvartzman, A., Waingarten, E., Aaronson, S.: The fewest clues problem. Theor. Comput. Sci. 748, 28\u201339 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"18_CR9","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/0196-6774(86)90002-7","volume":"7","author":"ME Dyer","year":"1986","unstructured":"Dyer, M.E., Frieze, A.M.: Planar 3dm is NP-complete. J. Algorithms 7(2), 174\u2013184 (1986)","journal-title":"J. Algorithms"},{"key":"18_CR10","unstructured":"Goergen, K., Fernau, H., Oest, E., Wolf, P.: All paths lead to Rome. CoRR, abs\/2207.09439 (2022)"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1017\/S0004972700017883","volume":"41","author":"K Gray","year":"1990","unstructured":"Gray, K.: On the minimum number of blocks defining a design. Bull. Aust. Math. Soc. 41(1), 97\u2013112 (1990)","journal-title":"Bull. Aust. Math. Soc."},{"issue":"1","key":"18_CR12","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01192587","volume":"6","author":"F Harary","year":"1991","unstructured":"Harary, F., Klein, D.J., \u017divkovi\u010d, T.P.: Graphical properties of polyhexes: perfect matching vector and forcing. J. Math. Chem. 6(1), 295\u2013306 (1991)","journal-title":"J. Math. Chem."},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/050641594","volume":"37","author":"F Harary","year":"2007","unstructured":"Harary, F., Slany, W., Verbitsky, O.: On the computational complexity of the forcing chromatic number. SIAM J. Comput. 37(1), 1\u201319 (2007)","journal-title":"SIAM J. Comput."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Higuchi, Y., Kimura, K.: NP-completeness of fill-a-pix and $$\\sigma ^p_2$$-completeness of its fewest clues problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(11), 1490\u20131496 (2019)","DOI":"10.1587\/transfun.E102.A.1490"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Horiyama, T., Kobayashi, Y., Ono, H., Seto, K., Suzuki, R.: Theoretical aspects of generating instances with unique solutions: pre-assignment models for unique vertex cover. In: Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, pp. 20726\u201320734 (2024)","DOI":"10.1609\/aaai.v38i18.30060"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Hunt III, H.B., Marathe, M.V., Radhakrishnan, V., Stearns, R.E.: The complexity of planar counting problems. SIAM J. Comput. 27(4), 1142\u20131167 (1998)","DOI":"10.1137\/S0097539793304601"},{"key":"18_CR17","unstructured":"Kimura, K., Kamehashi, T., Fujito, T.: The fewest clues problem of picross 3D. In: Proceedings of the 9th International Conference on Fun with Algorithms, FUN 2018. LIPIcs, vol. 100, pp. 25:1\u201325:13 (2018)"},{"issue":"4","key":"18_CR18","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1002\/jcc.540080432","volume":"8","author":"DJ Klein","year":"1987","unstructured":"Klein, D.J., Randi\u0107, M.: Innate degree of freedom of a graph. J. Comput. Chem. 8(4), 516\u2013521 (1987)","journal-title":"J. Comput. Chem."},{"issue":"4","key":"18_CR19","doi-asserted-by":"publisher","first-page":"469","DOI":"10.5562\/cca2295","volume":"86","author":"C Larson","year":"2013","unstructured":"Larson, C., Van Cleemput, N.: Forcing independence. Croatia Chem. Acta 86(4), 469\u2013475 (2013)","journal-title":"Croatia Chem. Acta"},{"issue":"1","key":"18_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0378-3758(98)00053-6","volume":"73","author":"ES Mahmoodian","year":"1998","unstructured":"Mahmoodian, E.S.: Defining sets and uniqueness in graph colorings: a survey. J. Stat. Plann. Inference 73(1), 85\u201389 (1998)","journal-title":"J. Stat. Plann. Inference"},{"issue":"3","key":"18_CR21","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10910-006-9133-6","volume":"42","author":"D Vuki\u011bevi\u0107","year":"2007","unstructured":"Vuki\u011bevi\u0107, D., Trinajsti\u0107, N.: On the anti-forcing number of benzenoids. J. Math. Chem. 42(3), 575\u2013583 (2007)","journal-title":"J. Math. Chem."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04700-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:47Z","timestamp":1758498347000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fct.ii.uni.wroc.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}