Abstract
In view of the interesting applications of alternating Euler trails, it is natural to ask about the existence of Euler trails fulfilling some restriction other than alternating. Let H be a graph possibly with loops and G a multigraph without loops. G is said to be H-colored if there exists a function \(c:E(G) \rightarrow V(H)\). A trail \(W = (v_0, e_0, v_1, e_1, \ldots , e_{k-1}, v_k)\) in G is an H-trail if and only if \((c(e_0), a_0, c(e_1), \ldots , c(e_{k-2}), a_{k-2}, c(e_{k-1}))\) is a walk in H with \(a_i=c(e_{i})c(e_{i+1})\) for every i in \(\{0, \ldots , k-2\}\). In particular an H-trail is a properly colored trail when H is a complete graph without loops. An H-trail \(T = (v_0, e_0, v_1, e_1, \ldots , e_{k-1}, v_k)\) is a closedH-trail if \(v_0=v_k\), and \(c(e_{k-1}\)) and \(c(e_0)\) are adjacent in H. A closed H-trail, T, is a closed EulerH-trail if \(E(T)=E(G)\). In order to see that H-coloring theory is related to the automata theory, let each vertex represents a state and each edge of H represents an allowed transition. This implies that an H-walk in a multigraph G is a predetermined sequence of allowed operations. Another interesting application goes as follows: a safe route conducted by a health inspector in a hospital (a route where the inspector does not carry bacteria from one area to another, in which can be deadly the spread such a bacteria) is given whenever the multigraph associated with the map of the hospital be an eulerian graph and it has a closed Euler H-trail for some well chosen H. Because of applications of Euler H-trails, it is natural to ask the following: (i) What structural properties of H imply the existence of Euler H-trails? (ii) What structural properties of G, with respect to the H-coloring, imply the existence of Euler H-trails? In this paper, we study Euler H-trails and we will show a characterization of the graphs containing an Euler H-trail. As a consequence of the main result we obtain a classical result proved by Kotzig (Matematickì časopis 18(1):76–80, 1968).
Similar content being viewed by others
References
Ahuja, S.K.: Algorithms for routing and channel assignment in wireless infrastructure networks, Ph.D. thesis. Univ. Arizona (2010)
Arpin, P., Linek, V.: Reachability problems in edge-colored digraphs. Discrete Math. 307, 2276–2289 (2007)
Bang-Jensen, J., Gutin, G.: Digraphs: Theory. Algorithms and Applications. Springer, London (2009)
Bernhard, K., Vygen, J.: Combinatorial Optimization: Theory and algorithms, 3rd edn. Springer, Berlin (2005)
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, 1st edn. North-Holland, Amsterdam (1976)
Chow, W., Manoussakis, Y., Megalakaki, O., Spyratos, M., Tuza, Z.: Paths through fixed vertices in edge-colored graphs. Math. Inf. Sci. Hum. 127, 49–58 (1994)
Delgado-Escalante, P., Galeana-Sánchez, H.: Restricted domination in arc-colored digraphs. AKCE Int. J. Graphs Combin. 11(1), 95–104 (2014)
Delgado-Escalante, P., Galeana-Sánchez, H., Pastrana-Ramírez, L.: Independent restricted domination and the line digraph. AKCE Int. J. Graphs Combin. 9(1), 31–42 (2012)
Dorninger, D.: On permutations of chromosomes. In: Contributions to General Algebra 5: Proceedings of the Salzburg Conference, May 29–June 1, 1986. Hölder-Pichler-Tempsky, Vienna, pp. 95–103 (1987)
Edmonds, J., Johnson, E.L.: Matching, Euler tours and the Chinese postman. Math. Program. 5(1), 88–124 (1973)
Fleischner, H., Sabidussi, G., Wenger, E.: Transforming Eulerian trails. Discrete Math. 109(1), 103–116 (1992)
Galeana-Sánchez, H., Sánchez-López, R.: \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs. Discrete Math. 338, 2288–2294 (2015)
Galeana-Sánchez, H., Torres-Ramos, I.: \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs. Graphs Combin. 31(3), 615–628 (2015)
Gutin, G., Jones, M., Sheng, B., Wahlstrom, M., Yeo, A.: Chinese postman problem on edge-colored multigraphs. Discrete Appl. Math. 217, 196–202 (2017)
Kotzig, A.: Moves without forbidden transitions in a graph. Matematickì časopis 18(1), 76–80 (1968)
Linek, V., Sands, B.: A note on paths in edge-colored tournaments. Ars Combin. 44, 225–228 (1996)
Petersen, J.: Die theorie der regulären graphs. Acta Math. 15, 193–220 (1891)
Pevzner, P.A.: Computational Molecular Biology: An Algorithmic Approach. MIT Press, Cambridge (2000)
Pevzner, P.A.: DNA physical mapping and alternating Eulerian cycles in colored graphs. Algorithmica 13, 77–105 (1995)
Sankararaman, S., Efrat, A., Ramasubramanian, S.: On channel-discontinuity-constraint routing in wireless networks. Ad Hoc Netw. 134, 153–169 (2014)
Sumner, D.P.: Graphs with 1-factors. Proc. Am. Math. Soc. 42, 8–12 (1974)
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–51 (2014)
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–219 (2009)
Tseng, I.L., Chen, H.W., Lee, C.I.: Obstacle-aware longest path routing with parallel MILP solvers. Proc. WCECS-ICCS 2, 827–831 (2010)
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–329 (2010)
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–480 (2009)
Acknowledgements
The authors wish to thank the anonymous referees for many suggestions which improved the rewriting of this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Hortensia Galeana-Sánchez’s research was supported partially by UNAM-DGAPA-PAPIIT IN106613-2 and CONACyT 219840.
Rights and permissions
About this article
Cite this article
Galeana-Sánchez, H., Rojas-Monroy, R., Sánchez-López, R. et al. Some Conditions for the Existence of Euler H-trails. Graphs and Combinatorics 35, 1197–1208 (2019). https://doi.org/10.1007/s00373-019-02066-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-019-02066-7