{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T19:13:29Z","timestamp":1648667609409},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"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":6894,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1016\/0304-3975(94)90184-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"449-461","source":"Crossref","is-referenced-by-count":0,"title":["On the orbits of the product of two permutations"],"prefix":"10.1016","volume":"131","author":[{"given":"A.","family":"Bergey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Cori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90184-8_BIB1","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1016\/0097-3165(72)90102-1","article-title":"Even permutations as a product of two conjugates cycles","volume":"12","author":"Bertram","year":"1972","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0304-3975(94)90184-8_BIB2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0012-365X(80)90001-1","article-title":"Nombre de repr\u00e9sentations d'une permutation comme produit de deux cycles de longueurs donn\u00e9es","volume":"29","author":"Boccara","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(94)90184-8_BIB3","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0195-6698(83)80024-9","article-title":"The orbits of the product of two permutations","volume":"4","author":"Brenner","year":"1983","journal-title":"European J. Combin."},{"key":"10.1016\/0304-3975(94)90184-8_BIB4","first-page":"403","article-title":"Maps and hypermaps I, II, III, a survey","volume":"10","author":"Cori","year":"1992","journal-title":"Exposition. Math."},{"key":"10.1016\/0304-3975(94)90184-8_BIB5","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1109\/SFCS.1989.63515","article-title":"Incremental planarity testing","author":"Di Battista","year":"1989","journal-title":"Proc. 30th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(94)90184-8_BIB6","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1145\/44483.44485","article-title":"Finding a maximum genus of a graph imbedding","volume":"35","author":"Furst","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)90184-8_BIB7","series-title":"Computer and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(94)90184-8_BIB8","series-title":"Topological Graph Theory","author":"Gross","year":"1990"},{"key":"10.1016\/0304-3975(94)90184-8_BIB9","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)90184-8_BIB10","first-page":"625","article-title":"Sur le genre d'une paire de substitutions","volume":"267","author":"Jacques","year":"1968","journal-title":"C.R. Acad. Sci. Paris A"},{"key":"10.1016\/0304-3975(94)90184-8_BIB11","series-title":"Symmetric Functions and Hall Polynomials","author":"McDonald","year":"1979"},{"key":"10.1016\/0304-3975(94)90184-8_BIB12","article-title":"Maps associated with given partitions","author":"Mach\u00ed","year":"1982","journal-title":"Actes de la f\u00eate des mots"},{"key":"10.1016\/0304-3975(94)90184-8_BIB13","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90184-8_BIB14","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0095-8956(79)90058-3","article-title":"How to determine the maximum genus of a graph","volume":"B 26","author":"Xuong","year":"1979","journal-title":"J. Combin. Theory Ser."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901848?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901848?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T11:16:40Z","timestamp":1580901400000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594901848"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0304397594901848"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90184-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}