{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T11:48:52Z","timestamp":1762429732367},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8447,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1016\/0166-218x(90)90072-k","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"283-285","source":"Crossref","is-referenced-by-count":16,"title":["Computing the binding number of a graph"],"prefix":"10.1016","volume":"27","author":[{"given":"William H.","family":"Cunningham","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90072-K_BIB1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0095-8956(71)90041-4","article-title":"Perfect matchings of a graph","volume":"10","author":"Anderson","year":"1971","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0166-218X(90)90072-K_BIB2","author":"Bauer","year":"1988","journal-title":"Recognizing tough graphs is NP-hard"},{"key":"10.1016\/0166-218X(90)90072-K_BIB3","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\/0166-218X(90)90072-K_BIB4","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/3828.3829","article-title":"Optimal attack and reinforcement of a network","volume":"32","author":"Cunningham","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(90)90072-K_BIB5","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/0218003","article-title":"A fast parametric maximum flow algorithm and applications","volume":"18","author":"Gallo","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90072-K_BIB6","series-title":"Graphs and Algorithms","author":"Gondran","year":"1984"},{"key":"10.1016\/0166-218X(90)90072-K_BIB7","series-title":"Computing the strength of a network in O(|V|3E|) time","author":"Gusfield","year":"1987"},{"key":"10.1016\/0166-218X(90)90072-K_BIB8","first-page":"201","article-title":"Product graphs and binding number","volume":"11","author":"Kane","year":"1981","journal-title":"Ars Combin."},{"key":"10.1016\/0166-218X(90)90072-K_BIB9","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"},{"key":"10.1016\/0166-218X(90)90072-K_BIB10","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0095-8956(73)90038-5","article-title":"The binding number of a graph and its Anderson number","volume":"15","author":"Woodall","year":"1973","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090072K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090072K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:57:06Z","timestamp":1555135026000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090072K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["0166218X9090072K"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90072-k","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}