{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T13:31:06Z","timestamp":1698499866960},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"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":8812,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1016\/0095-8956(89)90050-6","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T09:37:08Z","timestamp":1107941828000},"page":"257-291","source":"Crossref","is-referenced-by-count":14,"title":["Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs"],"prefix":"10.1016","volume":"46","author":[{"given":"Carsten","family":"Thomassen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(89)90050-6_BIB1","series-title":"Selected Topics in Graph Theory","first-page":"169","article-title":"Tournaments","author":"Beineke","year":"1979"},{"key":"10.1016\/0095-8956(89)90050-6_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190050102","article-title":"Cycles in digraphs\u2014A survey","volume":"5","author":"Bermond","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/0095-8956(89)90050-6_BIB3","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/BF02579268","article-title":"Cycles through specified vertices of a graph","volume":"1","author":"Bondy","year":"1981","journal-title":"Combinatorica"},{"issue":"2","key":"10.1016\/0095-8956(89)90050-6_BIB4","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1112\/jlms\/s2-3.2.378","article-title":"Arc mappings and tournament isomorphisms","volume":"3","author":"Goldberg","year":"1971","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0095-8956(89)90050-6_BIB5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0195-6698(83)80018-3","article-title":"Long cycles generate the cycle space","volume":"4","author":"Hartman","year":"1983","journal-title":"European J. Combin"},{"key":"10.1016\/0095-8956(89)90050-6_BIB6","first-page":"345","article-title":"The concept of a vertex in a matroid, the non-separating cycles of a graph and a new criterion for graph planarity","volume":"25","author":"Kelmans","year":"1978","journal-title":"Coll. Math. Soc. J\u00e1nos Bolyai"},{"key":"10.1016\/0095-8956(89)90050-6_BIB7","first-page":"261","article-title":"Sur le nombre de circuit dans un tournois fortement connexe","volume":"17","author":"Las Vergnas","year":"1975","journal-title":"Cahiers Centre \u00c9tudes Rech. Op\u00e9r."},{"key":"10.1016\/0095-8956(89)90050-6_BIB8","series-title":"Characterization of even digraphs","author":"Seymour","year":"1984"},{"key":"10.1016\/0095-8956(89)90050-6_BIB9","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0095-8956(80)90061-1","article-title":"Hamiltonian-connected tournaments","volume":"28","author":"Thomassen","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(89)90050-6_BIB10","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0095-8956(80)90083-0","article-title":"Planarity and duality of finite and infinite graphs","volume":"29","author":"Thomassen","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(89)90050-6_BIB11","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0095-8956(82)90064-8","article-title":"Duality of infinite graphs","volume":"33","author":"Thomassen","year":"1982","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(89)90050-6_BIB12","series-title":"Graph Theory and Combinatorics","first-page":"305","article-title":"Connectivity in tournaments","author":"Thomassen","year":"1984"},{"key":"10.1016\/0095-8956(89)90050-6_BIB13","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1002\/jgt.3190040106","article-title":"On Whitney's 2-isomorphism theorem for graphs","volume":"4","author":"Truemper","year":"1980","journal-title":"J. Graph Theory"},{"key":"10.1016\/0095-8956(89)90050-6_BIB14","first-page":"743","article-title":"How to draw a graph","volume":"13","author":"Tutte","year":"1963"},{"key":"10.1016\/0095-8956(89)90050-6_BIB15","doi-asserted-by":"crossref","first-page":"245","DOI":"10.2307\/2371127","article-title":"2-isomorphic graphs","volume":"55","author":"Whitney","year":"1933","journal-title":"Amer. J. Math."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895689900506?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895689900506?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T10:53:08Z","timestamp":1548759188000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895689900506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["0095895689900506"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(89)90050-6","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}