{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T07:29:23Z","timestamp":1648970963197},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"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":8539,"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,3]]},"DOI":"10.1016\/0012-365x(90)90249-h","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"297-312","source":"Crossref","is-referenced-by-count":3,"title":["On ringeisen's isolation game"],"prefix":"10.1016","volume":"80","author":[{"given":"A.G.","family":"Robinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.J.","family":"Goldman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(90)90249-H_BIB1","first-page":"91","article-title":"Sur les jeux positionelles","volume":"18","author":"Berge","year":"1976","journal-title":"Cahiers Centre Etudes Rech. Oper."},{"key":"10.1016\/0012-365X(90)90249-H_BIB2","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0012-365X(90)90249-H_BIB3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0166-218X(80)90038-4","article-title":"On deciding switching equivalence of graphs","volume":"2","author":"Colbourn","year":"1980","journal-title":"Discrete Applied Math."},{"key":"10.1016\/0012-365X(90)90249-H_BIB4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1038\/scientificamerican0757-145","article-title":"Mathematical games","volume":"197","author":"Gardner","year":"1957","journal-title":"Scientific American"},{"key":"10.1016\/0012-365X(90)90249-H_BIB5","series-title":"A Guide to the Theory of NP-Completeness","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(90)90249-H_BIB6","series-title":"Technical Report No. 381","article-title":"Eulerian Graphs, Switching Classes and the Isolation Game","author":"Goldman","year":"1983"},{"key":"10.1016\/0012-365X(90)90249-H_BIB7","first-page":"111","article-title":"Achievement and avoidance games for graphs","volume":"13","author":"Harary","year":"1982","journal-title":"Annals of Discrete Math."},{"key":"10.1016\/0012-365X(90)90249-H_BIB8","first-page":"348","article-title":"Equilateral point sets in elliptic geometry","volume":"A69","author":"van Lint","year":"1966","journal-title":"Nederl. Akad. Wetensch. Proc."},{"key":"10.1016\/0012-365X(90)90249-H_BIB9","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1137\/0128070","article-title":"Two-graphs, switching classes and Euler graphs are equal in number","volume":"28","author":"Mallows","year":"1975","journal-title":"SIAM J. Applied Math."},{"key":"10.1016\/0012-365X(90)90249-H_BIB10","doi-asserted-by":"crossref","first-page":"132","DOI":"10.2307\/2689268","article-title":"Isolation: a game on a graph","volume":"47","author":"Ringeisen","year":"1974","journal-title":"Math. Mag."},{"key":"10.1016\/0012-365X(90)90249-H_BIB11","series-title":"Doctoral Dissertation","article-title":"The Isolation Game and its Generalization","author":"Robinson","year":"1986"},{"issue":"2","key":"10.1016\/0012-365X(90)90249-H_BIB12","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0095-8956(84)90068-6","article-title":"Generalized Petersen graphs which are cycle permutation graphs","volume":"37","author":"Stueckle","year":"1984","journal-title":"J. Combinat. Theory B"},{"issue":"1","key":"10.1016\/0012-365X(90)90249-H_BIB13","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1137\/0603011","article-title":"Switchings constrained to 2-connectivity in simple graphs","volume":"3","author":"Taylor","year":"1982","journal-title":"SIAM J. Alg. Disc. Meth."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090249H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090249H?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:52:43Z","timestamp":1555134763000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9090249H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["0012365X9090249H"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90249-h","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}