{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,18]],"date-time":"2023-11-18T01:18:58Z","timestamp":1700270338746},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"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":8264,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1016\/0012-365x(90)90362-l","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"215-224","source":"Crossref","is-referenced-by-count":5,"title":["Dominating cycles in halin graphs"],"prefix":"10.1016","volume":"86","author":[{"given":"Miros\u0142awa","family":"Skowro\u0144ska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej M.","family":"Sys\u0142o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(90)90362-L_BIB1","first-page":"181","article-title":"Pancyclic graphs: recent results","volume":"10","author":"Bondy","year":"1975"},{"key":"10.1016\/0012-365X(90)90362-L_BIB2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0167-6377(85)90044-6","article-title":"Finding minimum dominating cycles in permutation graphs","volume":"4","author":"Colbourn","year":"1985","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0012-365X(90)90362-L_BIB3","first-page":"107","article-title":"Dominating cycles in series-parallel graphs","volume":"19","author":"Colbourne","year":"1985","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(90)90362-L_BIB4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF02591867","article-title":"Halin graphs and the travelling salesman problem","volume":"26","author":"Cornu\u00e9jols","year":"1983","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(90)90362-L_BIB5","series-title":"Combinatorial Mathematics and Its Applications","first-page":"129","article-title":"Studies in minimally connected graphs","author":"Halin","year":"1971"},{"key":"10.1016\/0012-365X(90)90362-L_BIB6","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/BF00995176","article-title":"Minimum dominating cycles in 2-trees","volume":"8","author":"Proskurowski","year":"1979","journal-title":"Internat. J. Comput. Inform. Sci."},{"key":"10.1016\/0012-365X(90)90362-L_BIB7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF00977745","article-title":"Minimum dominating cycles in outerplanar graphs","volume":"10","author":"Proskurowski","year":"1981","journal-title":"Internat. J. Comput. and Inform. Sci."},{"key":"10.1016\/0012-365X(90)90362-L_BIB8","first-page":"179","article-title":"The pancyclicity of Halin graphs and their exterior contractions","volume":"27","author":"Skowro\u0144ska","year":"1985","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(90)90362-L_BIB9","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1137\/0210062","article-title":"An efficient cycle vector space algorithm for listing all cycles of a planar graph","volume":"10","author":"Sys\u0142o","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(90)90362-L_BIB10","series-title":"Proceedings of the WG'83","first-page":"342","article-title":"NP-complete problems on some tree-structured graphs: a review","author":"Sys\u0142o","year":"1984"},{"key":"10.1016\/0012-365X(90)90362-L_BIB11","series-title":"Selected Topics in Operations Research and Mathematical Economics","first-page":"325","article-title":"On two problems related to the travelling salesman problem on Halin graphs","author":"Sys\u0142o","year":"1984"},{"key":"10.1016\/0012-365X(90)90362-L_BIB12","first-page":"289","article-title":"Linear algorithms for the dominating cycle problems in series-parallel graphs, partial k-trees and Halin graphs","volume":"56","author":"Wimer","year":"1987","journal-title":"Congr. Numer."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090362L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090362L?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:56:04Z","timestamp":1555134964000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9090362L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["0012365X9090362L"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90362-l","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}