{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:41:05Z","timestamp":1720201265463},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871034","12131013"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1016\/j.tcs.2022.01.012","type":"journal-article","created":{"date-parts":[[2022,1,7]],"date-time":"2022-01-07T11:15:01Z","timestamp":1641554101000},"page":"26-33","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Rainbow edge-pancyclicity of strongly edge-colored graphs"],"prefix":"10.1016","volume":"907","author":[{"given":"Luyi","family":"Li","sequence":"first","affiliation":[]},{"given":"Xueliang","family":"Li","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2022.01.012_br0010","series-title":"Pancyclic Graphs Proceedings of the Second Louisiana Conference on Combinatorics","first-page":"167","article-title":"Pancyclic graphs","author":"Bondy","year":"1971"},{"key":"10.1016\/j.tcs.2022.01.012_br0020","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","article-title":"Graph Theory","author":"Bondy","year":"2008"},{"key":"10.1016\/j.tcs.2022.01.012_br0030","doi-asserted-by":"crossref","first-page":"1186","DOI":"10.1016\/j.disc.2019.01.002","article-title":"Rainbow Hamiltonian cycles in strongly edge-colored graphs","volume":"342","author":"Cheng","year":"2019","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2022.01.012_br0040","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2021.103316","article-title":"On odd rainbow cycles in edge-colored graphs","volume":"94","author":"Czygrinow","year":"2021","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.tcs.2022.01.012_br0050","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2019.103037","article-title":"Rainbow triangles and cliques in edge-colored graphs","volume":"84","author":"Ehard","year":"2020","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.tcs.2022.01.012_br0060","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1002\/jgt.22163","article-title":"Color degree and monochromatic degree conditions for short properly colored cycles in edge-colored graphs","volume":"87","author":"Fujita","year":"2018","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.tcs.2022.01.012_br0070","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(90)90163-C","article-title":"Extending cycles in graphs","volume":"85","author":"Hendry","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2022.01.012_br0080","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s00373-008-0789-5","article-title":"Monochromatic and heterochromatic subgraphs in edge-colored graphs \u2013 a survey","volume":"24","author":"Kano","year":"2008","journal-title":"Graphs Comb."},{"key":"10.1016\/j.tcs.2022.01.012_br0090","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1002\/jgt.22536","article-title":"Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs","volume":"94","author":"Li","year":"2020","journal-title":"J. Graph Theory"},{"issue":"1","key":"10.1016\/j.tcs.2022.01.012_br0100","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1137\/120903750","article-title":"An edge-colored version of Dirac's theorem","volume":"28","author":"Lo","year":"2014","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.tcs.2022.01.012_br0110","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s00493-015-3067-1","article-title":"Properly colored Hamiltonian cycles in edge-colored complete graphs","volume":"36","author":"Lo","year":"2016","journal-title":"Combinatorica"},{"key":"10.1016\/j.tcs.2022.01.012_br0120","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.disc.2014.02.003","article-title":"Long properly colored cycles in edge-colored complete graphs","volume":"324","author":"Wang","year":"2014","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2022.01.012_br0130","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2020.112164","article-title":"Rainbow vertex-pancyclicity of strongly edge-colored graphs","volume":"344","author":"Wang","year":"2021","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2022.01.012_br0140","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1006\/jctb.1997.1728","article-title":"A note on alternating cycles in edge-colored graphs","volume":"69","author":"Yeo","year":"1997","journal-title":"J. Comb. Theory, Ser. B"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397522000123?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397522000123?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T05:13:44Z","timestamp":1674796424000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397522000123"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3]]},"references-count":14,"alternative-id":["S0304397522000123"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2022.01.012","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2022,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Rainbow edge-pancyclicity of strongly edge-colored graphs","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2022.01.012","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}