{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T23:33:10Z","timestamp":1778715190648,"version":"3.51.4"},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,4,1]],"date-time":"1987-04-01T00:00:00Z","timestamp":544233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T00:00:00Z","timestamp":1378857600000},"content-version":"vor","delay-in-days":9660,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[1987,4]]},"DOI":"10.1016\/s0195-6698(87)80012-4","type":"journal-article","created":{"date-parts":[[2013,9,10]],"date-time":"2013-09-10T12:57:25Z","timestamp":1378817845000},"page":"209-212","source":"Crossref","is-referenced-by-count":31,"title":["Factoring a Graph in Polynomial Time"],"prefix":"10.1016","volume":"8","author":[{"given":"Peter","family":"Winkler","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0195-6698(87)80012-4_bib1","doi-asserted-by":"crossref","unstructured":"J. Feigenbaum, J. Hershberger, A. Schaffer, A polynomial time algorithm for finding the prime factors of Cartesian-product graphs, Disc. Appl. Math. 12 (2), 123-138.","DOI":"10.1016\/0166-218X(85)90066-6"},{"key":"10.1016\/S0195-6698(87)80012-4_bib2","doi-asserted-by":"crossref","unstructured":"R.L. Graham, P.M. Winkler, On isometric embeddings of graphs, Trans. Amer. Math. Soc. 288 (2), 527-536.","DOI":"10.1090\/S0002-9947-1985-0776391-5"},{"key":"10.1016\/S0195-6698(87)80012-4_bib3","series-title":"Private communication","author":"Imrich","year":"1984"},{"key":"10.1016\/S0195-6698(87)80012-4_bib4","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/BF01162967","article-title":"Graph multiplication","volume":"72","author":"Sabidussi","year":"1960","journal-title":"Math. Zeitschr."},{"key":"10.1016\/S0195-6698(87)80012-4_bib5","series-title":"Applications of Graph Theory","first-page":"75","article-title":"Problems in computational complexity","author":"Welsh","year":"1982"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669887800124?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669887800124?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T21:27:19Z","timestamp":1563917239000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669887800124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,4]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,4]]}},"alternative-id":["S0195669887800124"],"URL":"https:\/\/doi.org\/10.1016\/s0195-6698(87)80012-4","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[1987,4]]}}}