{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:01:52Z","timestamp":1748404912577,"version":"3.41.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"CONACyT","award":["782239"],"award-info":[{"award-number":["782239"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s00373-024-02868-4","type":"journal-article","created":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T19:41:13Z","timestamp":1733168473000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic Cycles in Edge-Colored Multigraphs"],"prefix":"10.1007","volume":"41","author":[{"given":"Hortensia","family":"Galeana-S\u00e1nchez","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6330-3015","authenticated-orcid":false,"given":"Carlos","family":"Vilchis-Alfaro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,2]]},"reference":[{"key":"2868_CR1","doi-asserted-by":"publisher","unstructured":"Bang-Jensen, J., Gutin, G.Z.: Digraphs: Theory, Algorithms and Applications. Springer, London (2009). https:\/\/doi.org\/10.1007\/978-1-84800-998-1","DOI":"10.1007\/978-1-84800-998-1"},{"key":"2868_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory With Applications","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory With Applications. The Macmillan Press Ltd., London (1976)"},{"issue":"6","key":"2868_CR3","doi-asserted-by":"publisher","first-page":"2601","DOI":"10.1007\/S00373-021-02377-8\/METRICS","volume":"37","author":"J Bang-Jensen","year":"2021","unstructured":"Bang-Jensen, J., Bellitto, T., Yeo, A.: On supereulerian 2-edge-coloured graphs. Graphs Combin. 37(6), 2601\u20132620 (2021). https:\/\/doi.org\/10.1007\/S00373-021-02377-8\/METRICS","journal-title":"Graphs Combin."},{"issue":"4","key":"2868_CR4","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1002\/JGT.21877","volume":"81","author":"J Bar\u00e1t","year":"2016","unstructured":"Bar\u00e1t, J., S\u00e1rk\u00f6zy, G.N.: Partitioning 2-edge-colored ore-type graphs by monochromatic cycles. J. Graph Theory 81(4), 317\u2013328 (2016). https:\/\/doi.org\/10.1002\/JGT.21877","journal-title":"J. Graph Theory"},{"issue":"1","key":"2868_CR5","doi-asserted-by":"publisher","first-page":"112174","DOI":"10.1016\/J.DISC.2020.112174","volume":"344","author":"Z Guo","year":"2021","unstructured":"Guo, Z., Broersma, H., Li, B., Zhang, S.: Almost eulerian compatible spanning circuits in edge-colored graphs. Discrete Math. 344(1), 112174 (2021). https:\/\/doi.org\/10.1016\/J.DISC.2020.112174","journal-title":"Discrete Math."},{"issue":"7","key":"2868_CR6","doi-asserted-by":"publisher","first-page":"111908","DOI":"10.1016\/J.DISC.2020.111908","volume":"343","author":"Z Guo","year":"2020","unstructured":"Guo, Z., Li, B., Li, X., Zhang, S.: Compatible spanning circuits in edge-colored graphs. Discrete Math. 343(7), 111908 (2020). https:\/\/doi.org\/10.1016\/J.DISC.2020.111908","journal-title":"Discrete Math."},{"issue":"2","key":"2868_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0166-218X(92)00171-H","volume":"50","author":"D Dorninger","year":"1994","unstructured":"Dorninger, D.: Hamiltonian circuits determining the order of chromosomes. Discrete Appl. Math. 50(2), 159\u2013168 (1994). https:\/\/doi.org\/10.1016\/0166-218X(92)00171-H","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"2868_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1038\/hdy.1987.138","volume":"59","author":"D Dorninger","year":"1987","unstructured":"Dorninger, D., Timischl, W.: Geometrical constraints on Bennett\u2019s predictions of chromosome order. Heredity 59(3), 321\u2013325 (1987). https:\/\/doi.org\/10.1038\/hdy.1987.138","journal-title":"Heredity"},{"key":"2868_CR9","doi-asserted-by":"publisher","unstructured":"Szachniuk, M., Popenda, M., Adamiak, R.W., Blazewicz, J.: An assignment walk through 3D NMR spectrum. 2009 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, CIBCB 2009 - Proceedings, pp. 215\u2013219 (2009). https:\/\/doi.org\/10.1109\/CIBCB.2009.4925731","DOI":"10.1109\/CIBCB.2009.4925731"},{"key":"2868_CR10","first-page":"49","volume":"127","author":"WS Chou","year":"1994","unstructured":"Chou, W.S., Manoussakis, Y., Megalakaki, O., Spyratos, M., Tuza, Z.: Paths through fixed vertices in edge-colored graphs. Math. Inform. Sci. Humaines 127, 49\u201358 (1994)","journal-title":"Math. Inform. Sci. Humaines"},{"key":"2868_CR11","unstructured":"Ahuja, S.K.: Algorithms for routing and channel assignment in wireless infrastructure networks, PhD thesis, The University of Arizona (2010)"},{"key":"2868_CR12","doi-asserted-by":"publisher","unstructured":"Sankararaman, S., Efrat, A., Ramasubramanian, S., Agarwal, P.K.: On channel-discontinuity-constraint routing in wireless networks. Ad Hoc Networks 13(PART A), 153\u2013169 (2014). https:\/\/doi.org\/10.1016\/J.ADHOC.2011.04.011","DOI":"10.1016\/J.ADHOC.2011.04.011"},{"issue":"2","key":"2868_CR13","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1002\/JGT.3190160206","volume":"16","author":"AG Chetwynd","year":"1992","unstructured":"Chetwynd, A.G., Hilton, A.J.W.: Alternating hamiltonian cycles in two colored complete bipartite graphs. J. Graph Theory 16(2), 153\u2013158 (1992). https:\/\/doi.org\/10.1002\/JGT.3190160206","journal-title":"J. Graph Theory"},{"issue":"4","key":"2868_CR14","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1002\/JGT.20188","volume":"53","author":"J Feng","year":"2006","unstructured":"Feng, J., Giesen, H.E., Guo, Y., Gutin, G., Jensen, T., Rafiey, A.: Characterization of edge-colored complete graphs with properly colored Hamilton paths. J. Graph Theory 53(4), 333\u2013346 (2006). https:\/\/doi.org\/10.1002\/JGT.20188","journal-title":"J. Graph Theory"},{"issue":"1","key":"2868_CR15","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1002\/JGT.21751","volume":"76","author":"A Lo","year":"2014","unstructured":"Lo, A.: A Dirac type condition for properly coloured paths and cycles. J. Graph Theory 76(1), 60\u201387 (2014). https:\/\/doi.org\/10.1002\/JGT.21751","journal-title":"J. Graph Theory"},{"issue":"3","key":"2868_CR16","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1002\/JGT.22405","volume":"90","author":"A Lo","year":"2019","unstructured":"Lo, A.: Long properly coloured cycles in edge-coloured graphs. J. Graph Theory 90(3), 416\u2013442 (2019). https:\/\/doi.org\/10.1002\/JGT.22405","journal-title":"J. Graph Theory"},{"issue":"1","key":"2868_CR17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0095-8956(83)90008-4","volume":"34","author":"JW Grossman","year":"1983","unstructured":"Grossman, J.W., H\u00e4ggkvist, R.: Alternating cycles in edge-partitioned graphs. J. Combin. Theory Ser. B 34(1), 77\u201381 (1983). https:\/\/doi.org\/10.1016\/0095-8956(83)90008-4","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"2868_CR18","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1006\/JCTB.1997.1728","volume":"69","author":"A Yeo","year":"1997","unstructured":"Yeo, A.: A note on alternating cycles in edge-coloured graphs. J. Combin. Theory Ser. B 69(2), 222\u2013225 (1997). https:\/\/doi.org\/10.1006\/JCTB.1997.1728","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"2868_CR19","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1002\/JGT.20440","volume":"64","author":"A Abouelaoualim","year":"2010","unstructured":"Abouelaoualim, A., Das, K.C., Vega, W.F.D.L., Karpinski, M., Manoussakis, Y., Martinhon, C.A., Saad, R.: Cycles and paths in edge-colored graphs with given degrees. J. Graph Theory 64(1), 63\u201386 (2010). https:\/\/doi.org\/10.1002\/JGT.20440","journal-title":"J. Graph Theory"},{"key":"2868_CR20","first-page":"225","volume":"44","author":"V Linek","year":"1996","unstructured":"Linek, V., Sands, B.: A note on paths in edge-coloured tournaments. ARS Combin. 44, 225\u2013228 (1996)","journal-title":"ARS Combin."},{"issue":"1","key":"2868_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1080\/09728600.2012.12088947","volume":"9","author":"P Delgado-Escalante","year":"2012","unstructured":"Delgado-Escalante, P., Galeana-S\u00e1nchez, H., Ram\u00edrez, L.P.: Independent restricted domination and the line digraph. AKCE Int. J. Graphs Combin. 9(1), 31\u201342 (2012). https:\/\/doi.org\/10.1080\/09728600.2012.12088947","journal-title":"AKCE Int. J. Graphs Combin."},{"issue":"1","key":"2868_CR22","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1080\/09728600.2014.12088766","volume":"11","author":"P Delgado-Escalante","year":"2014","unstructured":"Delgado-Escalante, P., Galeana-S\u00e1nchez, H.: Restricted domination in arc-colored digraphs. AKCE Int. J. Graphs Combin. 11(1), 95\u2013104 (2014). https:\/\/doi.org\/10.1080\/09728600.2014.12088766","journal-title":"AKCE Int. J. Graphs Combin."},{"issue":"4","key":"2868_CR23","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1007\/S00373-012-1150-6\/METRICS","volume":"29","author":"H Galeana-S\u00e1nchez","year":"2013","unstructured":"Galeana-S\u00e1nchez, H., S\u00e1nchez-L\u00f3pez, R.: H-kernels in infinite digraphs. Graphs Combin. 29(4), 913\u2013920 (2013). https:\/\/doi.org\/10.1007\/S00373-012-1150-6\/METRICS","journal-title":"Graphs Combin."},{"issue":"5","key":"2868_CR24","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1007\/S00373-019-02066-7\/METRICS","volume":"35","author":"H Galeana-S\u00e1nchez","year":"2019","unstructured":"Galeana-S\u00e1nchez, H., Rojas-Monroy, R., S\u00e1nchez-L\u00f3pez, R., Villarreal-Vald\u00e9s, J.I.: Some conditions for the existence of Euler H-trails. Graphs Combin. 35(5), 1197\u20131208 (2019). https:\/\/doi.org\/10.1007\/S00373-019-02066-7\/METRICS","journal-title":"Graphs Combin."},{"issue":"3","key":"2868_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/S00373-022-02464-4\/METRICS","volume":"38","author":"H Galeana-S\u00e1nchez","year":"2022","unstructured":"Galeana-S\u00e1nchez, H., Rojas-Monroy, R., S\u00e1nchez-L\u00f3pez, R., Villarreal-Vald\u00e9s, J.I.: H-cycles in H-colored multigraphs. Graphs Combin. 38(3), 1\u201320 (2022). https:\/\/doi.org\/10.1007\/S00373-022-02464-4\/METRICS","journal-title":"Graphs Combin."},{"key":"2868_CR26","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/J.DAM.2019.04.020","volume":"267","author":"G Ben\u00edtez-Bobadilla","year":"2019","unstructured":"Ben\u00edtez-Bobadilla, G., Galeana-S\u00e1nchez, H., Hern\u00e1ndez-Cruz, C.: Characterization of color patterns by dynamic H-paths. Discrete Appl. Math. 267, 41\u201351 (2019). https:\/\/doi.org\/10.1016\/J.DAM.2019.04.020","journal-title":"Discrete Appl. Math."},{"key":"2868_CR27","doi-asserted-by":"publisher","unstructured":"Farr, E.R., Stoll, J.S., Beitl, C.M.: Effects of fisheries management on local ecological knowledge. Ecol. Soc. 23(3) (2018). https:\/\/doi.org\/10.5751\/ES-10344-230315","DOI":"10.5751\/ES-10344-230315"},{"issue":"5","key":"2868_CR28","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1007\/S10260-021-00596-0\/FIGURES\/9","volume":"30","author":"T Shafie","year":"2021","unstructured":"Shafie, T., Schoch, D.: Multiplexity analysis of networks using multigraph representations. Stat. Methods Appl. 30(5), 1425\u20131444 (2021). https:\/\/doi.org\/10.1007\/S10260-021-00596-0\/FIGURES\/9","journal-title":"Stat. Methods Appl."},{"key":"2868_CR29","doi-asserted-by":"publisher","unstructured":"Shafie, T.: A multigraph approach to social network analysis. J. Soc. Struct. 16 (2015). https:\/\/doi.org\/10.21307\/JOSS-2019-011","DOI":"10.21307\/JOSS-2019-011"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02868-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02868-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02868-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:22:32Z","timestamp":1748319752000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02868-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2868"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02868-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"28 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We have no conflict of interest to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"2"}}