{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T03:18:23Z","timestamp":1775618303379,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T00:00:00Z","timestamp":1739836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T00:00:00Z","timestamp":1739836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271311"],"award-info":[{"award-number":["12271311"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s00373-025-02902-z","type":"journal-article","created":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T22:24:46Z","timestamp":1739917486000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Structure of Minimally 1-Tough Graphs with Small Independence Number"],"prefix":"10.1007","volume":"41","author":[{"given":"Shiyu","family":"Cao","sequence":"first","affiliation":[]},{"given":"Jing","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,18]]},"reference":[{"key":"2902_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory, GTM 244","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory, GTM 244. Springer, New York (2008)"},{"issue":"3","key":"2902_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1002\/(SICI)1097-0037(199905)33:3<233::AID-NET9>3.0.CO;2-A","volume":"33","author":"HJ Broersma","year":"1999","unstructured":"Broersma, H.J., Engbers, E., Trommel, H.: Various results on the toughness of graphs. NETWORKS 33(3), 233\u2013238 (1999)","journal-title":"NETWORKS"},{"issue":"3","key":"2902_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","volume":"5","author":"V Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V.: Tough graphs and hamiltonian circuits. Discrete Math. 5(3), 215\u2013228 (1973)","journal-title":"Discrete Math."},{"key":"2902_CR4","unstructured":"Kaiser, T.:\u00a0Problems from the workshop on dominating cycles. https:\/\/iti.zcu.cz\/history\/2003\/Hajek\/"},{"issue":"1","key":"2902_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.disc.2017.08.033","volume":"341","author":"GY Katona","year":"2018","unstructured":"Katona, G.Y., Solt\u00e9sz, D., Varga, K.: Properties of minimally $$t$$-tough graphs. Discrete Math. 341(1), 221\u2013231 (2018)","journal-title":"Discrete Math."},{"issue":"3","key":"2902_CR6","first-page":"1","volume":"25","author":"GY Katona","year":"2023","unstructured":"Katona, G.Y., Varga, K.: Minimal toughness in special graph classes. Discrete Math. Theor. Comput. Sci. 25(3), 1\u201317 (2023)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"6","key":"2902_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113352","volume":"346","author":"H Ma","year":"2023","unstructured":"Ma, H., Hu, X., Yang, W.: On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3\/2-tough, claw-free graphs. Discrete Math. 346(6), 113352 (2023)","journal-title":"Discrete Math."},{"key":"2902_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2023.11.034","volume":"346","author":"H Ma","year":"2024","unstructured":"Ma, H., Hu, X., Yang, W.: The structure of minimally $$t$$-tough, 2$$K_2$$-free graphs. Discrete Appl. Math. 346, 1\u20139 (2024)","journal-title":"Discrete Appl. Math."},{"key":"2902_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF01222585","volume":"22","author":"W Mader","year":"1971","unstructured":"Mader, W.: Eine Eigenschaft der Atome endlicher Graphen. Arch. Math. 22, 333\u2013336 (1971)","journal-title":"Arch. Math."},{"key":"2902_CR10","unstructured":"Varga, K.:\u00a0Properties of minimally tough graphs. Budapest University of Technology and Economics, Ph.D. thesis (2021)"},{"issue":"7","key":"2902_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2024.113982","volume":"347","author":"W Zheng","year":"2024","unstructured":"Zheng, W., Sun, L.: Disproof of a conjecture on minimally $$t$$-tough graphs. Discrete Math. 347(7), 113982 (2024)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02902-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02902-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02902-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:16:56Z","timestamp":1746253016000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02902-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,18]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2902"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02902-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,18]]},"assertion":[{"value":"9 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"37"}}