Some Conditions for the Existence of Euler H-trails

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 (Matematicki casopis 18(1):76–80, 1968).

[1]  Pavel A. Pevzner,et al.  Computational molecular biology : an algorithmic approach , 2000 .

[2]  Jack Edmonds,et al.  Matching, Euler tours and the Chinese postman , 1973, Math. Program..

[3]  David P. Sumner,et al.  Graphs with 1-factors , 1974 .

[4]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[5]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[6]  Gregory Gutin,et al.  Chinese Postman Problem on edge-colored multigraphs , 2015, Discret. Appl. Math..

[7]  Emanuel Wenger,et al.  Transforming eulerian trails , 1992, Discret. Math..

[8]  Václav Linek,et al.  Reachability problems in edge-colored digraphs , 2007, Discret. Math..

[9]  Keith W. Hipel,et al.  Using matrices to link conflict evolution and resolution in a graph model , 2010, Eur. J. Oper. Res..

[10]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[11]  Jacek Blazewicz,et al.  An assignment walk through 3D NMR spectrum , 2009, 2009 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology.

[12]  Yannis Manoussakis,et al.  Paths through fixed vertices in edge-colored graphs , 1993 .

[13]  A. Kotzig Moves Without Forbidden Transitions in a Graph , 1968 .

[14]  Keith W. Hipel,et al.  A matrix approach to status quo analysis in the graph model for conflict resolution , 2009, Appl. Math. Comput..

[15]  Sandeep Kour Ahuja,et al.  Algorithms for Routing and channel Assignment in Wireless Infrastructure Networks , 2010 .

[16]  Pavel A. Pevzner,et al.  DNA physical mapping and alternating Eulerian cycles in colored graphs , 1995, Algorithmica.

[17]  Bill Sands,et al.  A note on paths in edge-coloured tournaments , 1996, Ars Comb..

[18]  Hortensia Galeana-Sánchez,et al.  H-kernels and H-obstructions in H-colored digraphs , 2015, Discret. Math..

[19]  J. Petersen Die Theorie der regulären graphs , 1891 .

[20]  Giovanni Felici,et al.  The Orderly Colored Longest Path Problem - a survey of applications and new algorithms , 2014, RAIRO Oper. Res..

[21]  I-Lun Tseng,et al.  Obstacle-Aware Longest-Path Routing with Parallel MILP Solvers , 2010 .

[22]  Hortensia Galeana-Sánchez,et al.  H-Paths and H-Cycles in H-Coloured Digraphs , 2015, Graphs Comb..