{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T21:04:55Z","timestamp":1784667895855,"version":"3.55.0"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100010029","name":"Taishan Scholar Foundation of Shandong Province","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010029","id-type":"DOI","asserted-by":"publisher"}]},{"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":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dam.2026.06.008","type":"journal-article","created":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T19:28:48Z","timestamp":1781465328000},"page":"274-286","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On minimally t-tough (K1\u222aK1,3)-free graphs"],"prefix":"10.1016","volume":"392","author":[{"given":"Kai","family":"Gao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.06.008_b1","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1002\/(SICI)1097-0037(199905)33:3<233::AID-NET9>3.0.CO;2-A","article-title":"Various results on the toughness of graphs","volume":"33","author":"Broersma","year":"1999","journal-title":"Networks"},{"key":"10.1016\/j.dam.2026.06.008_b2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s00373-025-02902-z","article-title":"The structure of minimally 1-tough graphs with small independence number","volume":"41","author":"Cao","year":"2025","journal-title":"Graphs Combin."},{"key":"10.1016\/j.dam.2026.06.008_b3","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2025.114814","article-title":"On minimally t-tough graphs with t\u22641","volume":"349","author":"Cao","year":"2026","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.06.008_b4","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2026.114993","article-title":"Constructions of minimally t-tough regular graphs","volume":"349","author":"Cheng","year":"2026","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.06.008_b5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","article-title":"Tough graphs and Hamiltonian circuits","volume":"5","author":"Chv\u00e1tal","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.06.008_b6","series-title":"On the existence of minimally tough graphs having large minimum degrees","author":"Hasanvand","year":"2025"},{"key":"10.1016\/j.dam.2026.06.008_b7","unstructured":"T. Kaiser, Problems from the workshop on dominating cycles, http:\/\/iti.zcu.cz\/history\/2003\/Hajek\/problems\/hajek-problems.ps."},{"key":"10.1016\/j.dam.2026.06.008_b8","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/j.disc.2017.08.033","article-title":"Properties of minimally t-tough graphs","volume":"341","author":"Katona","year":"2018","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.06.008_b9","first-page":"1","article-title":"Minimal toughness in special graph classes","volume":"25","author":"Katona","year":"2023","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"10.1016\/j.dam.2026.06.008_b10","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2023.113352","article-title":"On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3\/2-tough, claw-free graphs","volume":"346","author":"Ma","year":"2023","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.06.008_b11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dam.2023.11.034","article-title":"The structure of minimally t-tough 2K2-free graphs","volume":"346","author":"Ma","year":"2024","journal-title":"Discret. Appl. Math."},{"key":"10.1016\/j.dam.2026.06.008_b12","doi-asserted-by":"crossref","first-page":"147","DOI":"10.12677\/AAM.2023.121018","article-title":"Properties of some class of special tough graphs","volume":"12","author":"Ma","year":"2023","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/j.dam.2026.06.008_b13","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/jgt.3190080116","article-title":"Hamiltonian results in K1,3-free graphs","volume":"8","author":"Matthews","year":"1984","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.06.008_b14","article-title":"Disconnectes forbidden subgraphs, toughness and hamilton cycles","volume":"2013","author":"Nikoghosyan","year":"2013","journal-title":"ISRN Comb."},{"key":"10.1016\/j.dam.2026.06.008_b15","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.113982","article-title":"Disproof of a conjecture on minimally t-tough graphs","volume":"347","author":"Zheng","year":"2024","journal-title":"Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26003380?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26003380?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T20:45:14Z","timestamp":1784666714000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26003380"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":15,"alternative-id":["S0166218X26003380"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.06.008","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On minimally -tough -free graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.06.008","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}