{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T20:27:04Z","timestamp":1665779224515},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":6772,"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":[[1995,1]]},"DOI":"10.1016\/0166-218x(93)e0131-h","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:14:35Z","timestamp":1027649675000},"page":"19-35","source":"Crossref","is-referenced-by-count":4,"title":["On Halin subgraphs and supergraphs"],"prefix":"10.1016","volume":"56","author":[{"given":"S.B.","family":"Horton","sequence":"first","affiliation":[]},{"given":"R.Gary","family":"Parker","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)E0131-H_BIB1","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1137\/0216024","article-title":"An application of duality to edge-deletion problems","volume":"16","author":"Asano","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(93)E0131-H_BIB2","series-title":"Proceedings of the NATO Advanced Workshop on Topological Network Design: Analysis and Synthesis","article-title":"Algorithms for recognition of regular properties and decomposition of recursive graph families","author":"Borie","year":"1989"},{"key":"10.1016\/0166-218X(93)E0131-H_BIB3","first-page":"481","article-title":"Deterministic decomposition of recursive graph classes","volume":"4","author":"Borie","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(93)E0131-H_BIB4","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/BF01758777","article-title":"Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families","volume":"7","author":"Borie","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/0166-218X(93)E0131-H_BIB5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF02591867","article-title":"Halin graphs and the travelling salesman problem","volume":"26","author":"Cornuejols","year":"1983","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(93)E0131-H_BIB6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1112\/jlms\/s1-27.1.85","article-title":"A property of 4-chromatic graphs and some remarks on critical graphs","volume":"27","author":"Dirac","year":"1952","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0166-218X(93)E0131-H_BIB7","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(93)E0131-H_BIB8","series-title":"Combinatorial Mathematics and its Applications","first-page":"129","article-title":"Studies on minimally n-connected graphs","author":"Halin","year":"1971"},{"key":"10.1016\/0166-218X(93)E0131-H_BIB9","article-title":"Edge coloring planar graphs with two outerplanar subgraphs","author":"Heath","year":"1990"},{"key":"10.1016\/0166-218X(93)E0131-H_BIB10","article-title":"Graph approximation: issues and complexity","author":"Horton","year":"1991"},{"key":"10.1016\/0166-218X(93)E0131-H_BIB11","first-page":"160","article-title":"On a family of planar bicritical graphs","volume":"30","author":"Lov\u00e1sz","year":"1975"},{"key":"10.1016\/0166-218X(93)E0131-H_BIB12","first-page":"241","article-title":"Ear decompositions of elementary graphs and GF2-rank of perfect matchings","volume":"16","author":"Naddef","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0166-218X(93)E0131-H_BIB13","article-title":"Linear algorithms on k-terminal graphs","author":"Wimer","year":"1987"},{"key":"10.1016\/0166-218X(93)E0131-H_BIB14","series-title":"Proceedings of the 10th Annual ACM Symposium on Theory of Computing","first-page":"253","article-title":"Node-and edge-deletion np-complete problems","author":"Yannakakis","year":"1978"},{"key":"10.1016\/0166-218X(93)E0131-H_BIB15","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1137\/0210021","article-title":"Edge-deletion problems","volume":"10","author":"Yannakakis","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(93)E0131-H_BIB16","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1137\/0210022","article-title":"Node-deletion problems on bipartite graphs","volume":"10","author":"Yannakakis","year":"1981","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93E0131H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93E0131H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T21:54:36Z","timestamp":1555278876000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X93E0131H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["0166218X93E0131H"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)e0131-h","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}