{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T04:27:19Z","timestamp":1778732839421,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"CONACyT","award":["219840"],"award-info":[{"award-number":["219840"]}]},{"name":"CONACyT","award":["289847\/462324"],"award-info":[{"award-number":["289847\/462324"]}]},{"DOI":"10.13039\/501100006087","name":"Direcci\u00f3n General de Asuntos del Personal Acad\u00e9mico, Universidad Nacional Aut\u00f3noma de M\u00e9xico","doi-asserted-by":"publisher","award":["IN102320"],"award-info":[{"award-number":["IN102320"]}],"id":[{"id":"10.13039\/501100006087","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s00373-022-02464-4","type":"journal-article","created":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T16:05:32Z","timestamp":1647273932000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["H-Cycles in H-Colored Multigraphs"],"prefix":"10.1007","volume":"38","author":[{"given":"Hortensia","family":"Galeana-S\u00e1nchez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roc\u00edo","family":"Rojas-Monroy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9869-8379","authenticated-orcid":false,"given":"Roc\u00edo","family":"S\u00e1nchez-L\u00f3pez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juana Imelda","family":"Villarreal-Vald\u00e9s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,14]]},"reference":[{"key":"2464_CR1","unstructured":"Ahuja, S.K.: Algorithms for Routing and Channel Assignment in Wireless Infrastructure Networks, (Ph.D.thesis), Univ. Arizona (2010)"},{"key":"2464_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-998-1","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J Bang-Jensen","year":"2009","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer, London (2009)","edition":"2"},{"key":"2464_CR3","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, 1st edn. North-Holland (1976)","edition":"1"},{"key":"2464_CR4","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.cor.2018.08.005","volume":"101","author":"F Carrabs","year":"2019","unstructured":"Carrabs, F., Cerulli, R., Felici, G., Singh, G.: Exact approaches for the orderly colored longest path problem: performance comparison. Comput Oper Res 101, 275\u2013284 (2019)","journal-title":"Comput Oper Res"},{"key":"2464_CR5","first-page":"49","volume":"127","author":"W Chow","year":"1994","unstructured":"Chow, W., Manoussakis, Y., Megalakaki, O., Spyratos, M., Tuza, Z.: Paths through fixed vertices in edge-colored graphs. Math. Inform. Sci. Hum. 127, 49\u201358 (1994)","journal-title":"Math. Inform. Sci. Hum."},{"key":"2464_CR6","unstructured":"Dorninger, D.: On permutations of chromosomes. In: Contributions to General Algebra 5: Proceedings of the Salzburg Conference, May 29\u2013June 1, 1986. H\u00f6lder-Pichler-Tempsky, Vienna, pp. 95\u2013103 (1987)"},{"key":"2464_CR7","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 and paths in edge-partitioned graphs. J. Combin. Theory Ser. B 34, 77\u201381 (1983)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2464_CR8","first-page":"225","volume":"44","author":"V Linek","year":"1996","unstructured":"Linek, V., Sands, B.: A note on paths in edge-colored tournaments. Ars Combin. 44, 225\u2013228 (1996)","journal-title":"Ars Combin."},{"key":"2464_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J Petersen","year":"1891","unstructured":"Petersen, J.: Die theorie der regul\u00e4ren graphs. Acta Math. 15, 193\u2013220 (1891)","journal-title":"Acta Math."},{"key":"2464_CR10","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2022.001.0001","volume-title":"Computational Molecular Biology: An Algorithmic Approach","author":"PA Pevzner","year":"2000","unstructured":"Pevzner, P.A.: Computational Molecular Biology: An Algorithmic Approach. MIT Press, Cambridge (2000)"},{"key":"2464_CR11","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.adhoc.2011.04.011","volume":"134","author":"S Sankararaman","year":"2014","unstructured":"Sankararaman, S., Efrat, A., Ramasubramanian, S.: On channel-discontinuity-constraint routing in wireless networks. Ad Hoc Netw. 134, 153\u2013169 (2014)","journal-title":"Ad Hoc Netw."},{"issue":"14","key":"2464_CR12","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1016\/j.dam.2011.06.005","volume":"159","author":"S Fujita","year":"2011","unstructured":"Fujita, S., Magnant, C.: Properly colored paths and cycles. Discrete Appl. Math. 159(14), 1391\u20131397 (2011)","journal-title":"Discrete Appl. Math."},{"key":"2464_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1051\/ro\/2013046","volume":"48","author":"M Szachniuk","year":"2014","unstructured":"Szachniuk, M., De Cola, M.C., Felici, G.: The orderly colored longest path problem-a survey of applications and new algorithms. RAIRO-Oper. Res. 48, 25\u201351 (2014)","journal-title":"RAIRO-Oper. Res."},{"key":"2464_CR14","doi-asserted-by":"crossref","unstructured":"Szachniuk, M., Popenda, M., Adamiak, R.W., Blazewicz, J.: An assignment walk through 3D NMR spectrum. In: Proc. 2009 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, pp 215-219 (2009)","DOI":"10.1109\/CIBCB.2009.4925731"},{"key":"2464_CR15","first-page":"827","volume":"2","author":"IL Tseng","year":"2010","unstructured":"Tseng, I.L., Chen, H.W., Lee, C.I.: Obstacle-aware longest path routing with parallel MILP solvers. Proc. WCECS-ICCS 2, 827\u2013831 (2010)","journal-title":"Proc. WCECS-ICCS"},{"issue":"1","key":"2464_CR16","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.ejor.2010.03.025","volume":"207","author":"H Xu","year":"2010","unstructured":"Xu, H., Kilgour, D., Hipel, K., Kemkes, G.: Using matrices to link conflict evolution and resolution in a graph model. Eur. J. Oper. Res. 207(1), 318\u2013329 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"2464_CR17","first-page":"470","volume":"212","author":"H Xu","year":"2009","unstructured":"Xu, H., Li, K., Hipel, K., Kilgour, D.: A matrix approach to status quo analysis in the graph model for conflict resolution. Appl. Math. Comput. 212(2), 470\u2013480 (2009)","journal-title":"Appl. Math. Comput."},{"key":"2464_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, 222\u2013225 (1997)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02464-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02464-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02464-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T22:42:59Z","timestamp":1654814579000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02464-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,14]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["2464"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02464-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,14]]},"assertion":[{"value":"27 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"62"}}