{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T21:03:13Z","timestamp":1648846993903},"reference-count":10,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"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":6621,"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":[[1995,6]]},"DOI":"10.1016\/0012-365x(93)e0194-9","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"135-151","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of circuit intersection in graphs"],"prefix":"10.1016","volume":"141","author":[{"given":"Aviezri S.","family":"Fraenkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Loebl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)E0194-9_BIB1","first-page":"93","article-title":"A lemma on systems of knotted curves","volume":"9","author":"Alexander","year":"1923"},{"key":"10.1016\/0012-365X(93)E0194-9_BIB2","article-title":"The complexity of circuit intersection in graphs","author":"Fraenkel","year":"1991"},{"key":"10.1016\/0012-365X(93)E0194-9_BIB3","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01202790","article-title":"Conservatives weightings and ear-decompositions of graphs","volume":"13","author":"Frank","year":"1993","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(93)E0194-9_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(93)E0194-9_BIB5","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","article-title":"Planar formulae and their uses","volume":"11","author":"Lichtenstein","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(93)E0194-9_BIB6","series-title":"Matching Theory","author":"Lov\u00e0sz","year":"1986"},{"key":"10.1016\/0012-365X(93)E0194-9_BIB7","doi-asserted-by":"crossref","DOI":"10.1090\/memo\/0508","article-title":"An index of a graph with applications to knot theory","volume":"106","author":"Murasugi","year":"1993","journal-title":"Memoirs Amer. Math. Soc."},{"key":"10.1016\/0012-365X(93)E0194-9_BIB8","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/0012-365X(94)90132-5","article-title":"Maximality of the cycle code of a graph","volume":"128","author":"Sole","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)E0194-9_BIB9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0166-218X(93)90140-J","article-title":"The covering radius of the cycle code of a graph","volume":"45","author":"Sol\u00e9","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(93)E0194-9_BIB10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1090\/conm\/147\/01166","article-title":"Knots and braids: some algorithmic questions","volume":"147","author":"Welsh","year":"1993","journal-title":"Contemp. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93E01949?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93E01949?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T13:57:09Z","timestamp":1555250229000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X93E01949"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":10,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["0012365X93E01949"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)e0194-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}