{"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":1778732839417,"version":"3.51.4"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T00:00:00Z","timestamp":1565308800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T00:00:00Z","timestamp":1565308800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"UNAM-DGAPA-PAPIIT","award":["IN106613-2"],"award-info":[{"award-number":["IN106613-2"]}]},{"name":"CONACyT","award":["219840"],"award-info":[{"award-number":["219840"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s00373-019-02066-7","type":"journal-article","created":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T11:02:35Z","timestamp":1565348555000},"page":"1197-1208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Some Conditions for the Existence of Euler H-trails"],"prefix":"10.1007","volume":"35","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"}]},{"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":[[2019,8,9]]},"reference":[{"key":"2066_CR1","unstructured":"Ahuja, S.K.: Algorithms for routing and channel assignment in wireless infrastructure networks, Ph.D. thesis. Univ. Arizona (2010)"},{"key":"2066_CR2","doi-asserted-by":"publisher","first-page":"2276","DOI":"10.1016\/j.disc.2006.09.042","volume":"307","author":"P Arpin","year":"2007","unstructured":"Arpin, P., Linek, V.: Reachability problems in edge-colored digraphs. Discrete Math. 307, 2276\u20132289 (2007)","journal-title":"Discrete Math."},{"key":"2066_CR3","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. Springer, London (2009)"},{"key":"2066_CR4","volume-title":"Combinatorial Optimization: Theory and algorithms","author":"K Bernhard","year":"2005","unstructured":"Bernhard, K., Vygen, J.: Combinatorial Optimization: Theory and algorithms, 3rd edn. Springer, Berlin (2005)","edition":"3"},{"key":"2066_CR5","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, Amsterdam (1976)","edition":"1"},{"key":"2066_CR6","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. Inf. Sci. Hum. 127, 49\u201358 (1994)","journal-title":"Math. Inf. Sci. Hum."},{"issue":"1","key":"2066_CR7","first-page":"95","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)","journal-title":"AKCE Int. J. Graphs Combin."},{"issue":"1","key":"2066_CR8","first-page":"31","volume":"9","author":"P Delgado-Escalante","year":"2012","unstructured":"Delgado-Escalante, P., Galeana-S\u00e1nchez, H., Pastrana-Ram\u00edrez, L.: Independent restricted domination and the line digraph. AKCE Int. J. Graphs Combin. 9(1), 31\u201342 (2012)","journal-title":"AKCE Int. J. Graphs Combin."},{"key":"2066_CR9","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)"},{"issue":"1","key":"2066_CR10","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J Edmonds","year":"1973","unstructured":"Edmonds, J., Johnson, E.L.: Matching, Euler tours and the Chinese postman. Math. Program. 5(1), 88\u2013124 (1973)","journal-title":"Math. Program."},{"issue":"1","key":"2066_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0012-365X(92)90281-J","volume":"109","author":"H Fleischner","year":"1992","unstructured":"Fleischner, H., Sabidussi, G., Wenger, E.: Transforming Eulerian trails. Discrete Math. 109(1), 103\u2013116 (1992)","journal-title":"Discrete Math."},{"key":"2066_CR12","doi-asserted-by":"publisher","first-page":"2288","DOI":"10.1016\/j.disc.2015.05.021","volume":"338","author":"H Galeana-S\u00e1nchez","year":"2015","unstructured":"Galeana-S\u00e1nchez, H., S\u00e1nchez-L\u00f3pez, R.: $$H$$-kernels and $$H$$-obstructions in $$H$$-colored digraphs. Discrete Math. 338, 2288\u20132294 (2015)","journal-title":"Discrete Math."},{"issue":"3","key":"2066_CR13","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s00373-013-1395-8","volume":"31","author":"H Galeana-S\u00e1nchez","year":"2015","unstructured":"Galeana-S\u00e1nchez, H., Torres-Ramos, I.: $$H$$-paths and $$H$$-cycles in $$H$$-coloured digraphs. Graphs Combin. 31(3), 615\u2013628 (2015)","journal-title":"Graphs Combin."},{"key":"2066_CR14","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.dam.2016.08.005","volume":"217","author":"G Gutin","year":"2017","unstructured":"Gutin, G., Jones, M., Sheng, B., Wahlstrom, M., Yeo, A.: Chinese postman problem on edge-colored multigraphs. Discrete Appl. Math. 217, 196\u2013202 (2017)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"2066_CR15","first-page":"76","volume":"18","author":"A Kotzig","year":"1968","unstructured":"Kotzig, A.: Moves without forbidden transitions in a graph. Matematick\u00ec \u010dasopis 18(1), 76\u201380 (1968)","journal-title":"Matematick\u00ec \u010dasopis"},{"key":"2066_CR16","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":"2066_CR17","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":"2066_CR18","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":"2066_CR19","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01188582","volume":"13","author":"PA Pevzner","year":"1995","unstructured":"Pevzner, P.A.: DNA physical mapping and alternating Eulerian cycles in colored graphs. Algorithmica 13, 77\u2013105 (1995)","journal-title":"Algorithmica"},{"key":"2066_CR20","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."},{"key":"2066_CR21","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1090\/S0002-9939-1974-0323648-6","volume":"42","author":"DP Sumner","year":"1974","unstructured":"Sumner, D.P.: Graphs with 1-factors. Proc. Am. Math. Soc. 42, 8\u201312 (1974)","journal-title":"Proc. Am. Math. Soc."},{"key":"2066_CR22","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":"2066_CR23","doi-asserted-by":"crossref","unstructured":"Szachniuk, M., Popenda, M., Adamiak, R.W., Blazewicz, J.: An assignment walk through 3D NMR spectrum. In: Proceedings of 2009 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, pp. 215\u2013219 (2009)","DOI":"10.1109\/CIBCB.2009.4925731"},{"key":"2066_CR24","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":"2066_CR25","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":"2066_CR26","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"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02066-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02066-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02066-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,25]],"date-time":"2022-09-25T11:30:06Z","timestamp":1664105406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02066-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,9]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["2066"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02066-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,9]]},"assertion":[{"value":"20 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}