{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T23:14:32Z","timestamp":1654816472922},"reference-count":9,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"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":7321,"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":[[1993,7]]},"DOI":"10.1016\/0166-218x(93)90227-f","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"119-138","source":"Crossref","is-referenced-by-count":5,"title":["The efficiency of AC graphs"],"prefix":"10.1016","volume":"44","author":[{"given":"Jean R.S.","family":"Blair","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90227-F_BIB1","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/0095-8956(91)90004-4","article-title":"Clique graphs and Helly graphs","volume":"51","author":"Bandelt","year":"1991","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(93)90227-F_BIB2","doi-asserted-by":"crossref","unstructured":"P.J. Bernhard, S.T. Hedetniemi and D.P. Jacobs, Efficient sets in graphs, Discrete Appl. Math., to appear.","DOI":"10.1016\/0166-218X(93)90225-D"},{"key":"10.1016\/0166-218X(93)90227-F_BIB3","first-page":"72","article-title":"TR-matching for chordal graphs","author":"Blair","year":"1989","journal-title":"Proceedings Twenty-Seventh Conference on Communication, Control, and Computing"},{"key":"10.1016\/0166-218X(93)90227-F_BIB4","unstructured":"J.R.S. Blair and S.S. Ravi, private notes."},{"key":"10.1016\/0166-218X(93)90227-F_BIB5","series-title":"Proceedings 11th ICALP","first-page":"128","article-title":"Concurrent transmissions in broadcast networks","volume":"172","author":"Colburn","year":"1984"},{"key":"10.1016\/0166-218X(93)90227-F_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230140102","article-title":"On the NP-completeness of certain network-testing problems","volume":"14","author":"Even","year":"1984","journal-title":"Networks"},{"key":"10.1016\/0166-218X(93)90227-F_BIB7","series-title":"Tech. Rept. UO-CIS-TR-83-4","article-title":"On computing the open irredundance number of a tree","author":"Farley","year":"1983"},{"key":"10.1016\/0166-218X(93)90227-F_BIB8","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0020-0190(82)90077-1","article-title":"NP-completeness of some generalizations of the maximum matching problem","volume":"15","author":"Stockmyer","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(93)90227-F_BIB9","series-title":"Ph.D. thesis","article-title":"Linear algorithms on k-terminal graphs","author":"Wimer","year":"1987"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390227F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390227F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:51:19Z","timestamp":1555116679000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9390227F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["0166218X9390227F"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90227-f","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}