{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T00:55:21Z","timestamp":1768006521889,"version":"3.49.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1979,10,1]],"date-time":"1979-10-01T00:00:00Z","timestamp":307584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer and Information Sciences"],"published-print":{"date-parts":[[1979,10]]},"DOI":"10.1007\/bf00995176","type":"journal-article","created":{"date-parts":[[2005,1,18]],"date-time":"2005-01-18T13:41:43Z","timestamp":1106055703000},"page":"405-417","source":"Crossref","is-referenced-by-count":21,"title":["Minimum dominating cycles in 2-trees"],"prefix":"10.1007","volume":"8","author":[{"given":"Andrzej","family":"Proskurowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"D. W. Bange, A. E. Barkauskas, and P. Slater, ?Using associated trees to count the spanning trees of labeled maximal outerplanar graphs,?Proceedings of the Eighth S-E Conference on Combinatorics, Graph Theory, and Computing, pp. 605?614."},{"key":"CR2","unstructured":"T. Beyer, W. Jones, and S. Mitchell, ?Linear Algorithm for Isomorphism of Maximal Outer Planar Graphs,? CS-TR-78-1, University of Oregon, to appear inJACM."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0020-0190(75)90011-3","volume":"4","author":"E. J. Cockayne","year":"1975","unstructured":"E. J. Cockayne, S. E. Goodman, and S. T. Hedetniemi, ?A linear algorithm for the domination number of a tree,?Inf. Process. Lett. 4:41?44 (1975).","journal-title":"Inf. Process. Lett."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230070305","volume":"7","author":"E. J. Cockayne","year":"1977","unstructured":"E. J. Cockayne and S. T. Hedetniemi, ?Towards a theory of domination in graphs,?Networks 7:247?261 (1977).","journal-title":"Networks"},{"issue":"2","key":"CR5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.4153\/CMB-1977-034-8","volume":"20","author":"L. Lesniak-Foster","year":"1977","unstructured":"L. Lesniak-Foster and J. E. Williamson, ?On spanning and dominating circuits in graphs,?Can. Math. Bull. 20(2):215?220 (June 1977).","journal-title":"Can. Math. Bull."},{"key":"CR6","unstructured":"S. Mitchell, ?Algorithms on Trees and Maximal Outer Planar Graphs: Design, Complexity Analysis, and Data Structures Studies,? PhD thesis, University of Virginia (1976)."},{"key":"CR7","unstructured":"A. Proskurowski, ?Minimum Dominating Cycles of Maximal Outerplanar Graphs,? CS-TR-77-4, University of Oregon."},{"key":"CR8","unstructured":"A. Proskurowski, ?Shortest Paths in Recursive Graphs,? CS-TR-78-10, University of Oregon."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1145\/321958.321964","volume":"23","author":"P. Slater","year":"1976","unstructured":"P. Slater, ?R-domination in graphs,?JACM 23:446?450 (1976).","journal-title":"JACM"}],"container-title":["International Journal of Computer & Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00995176.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00995176\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00995176","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T18:59:09Z","timestamp":1556564349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00995176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,10]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1979,10]]}},"alternative-id":["BF00995176"],"URL":"https:\/\/doi.org\/10.1007\/bf00995176","relation":{},"ISSN":["0091-7036","1573-7640"],"issn-type":[{"value":"0091-7036","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,10]]}}}