References
- Ahuja, S. K. (2010). Algorithms for routing and channel assignment in wireless infrastructure networks. PhD thesis. University of Arizona, Arizona, USA.
- Bang-Jensen, J., Bellitto, T., Yeo, A. (2021). Supereulerian 2-edge-coloured graphs. Graphs Comb. 37(6): 2601–2620.
- Bang-Jensen, J., Gutin, G. Z. (2008). Digraphs: Theory, Algorithms and Applications. London: Springer.
- Benítez-Bobadilla, G.,Galeana-Sánchez, H., Hernández-Cruz, C. (2019). Characterization of color patterns by dynamic H-paths. Discrete Appl. Math. 267:41–51.
- Bondy, J. A., Murty, U. S. R. (1976). Graph Theory with Applications. London, UK: Macmillan.
- Chou, W., Manoussakis, Y., Megalakaki, O., Spyratos, M., Tuza, Z. (1994). Paths through fixed vertices in edge-colored graphs. Math. Inform. Sci. Humaines 127:49–58.
- Delgado-Escalante, P., Galeana-Sánchez, H. (2014). Restricted domination in arc-colored digraphs. AKCE Int. J. Graphs Comb. 11(1): 95–104.
- Delgado-Escalante, P., Galeana-Sánchez, H., Ramírez, L. P. (2012). Independent restricted domination and the line digraph. AKCE Int. J. Graphs Comb. 9(1): 31–42.
- Dorninger, D. (1994). Hamiltonian circuits determining the order of chromosomes. Discrete Appl. Math. 50(2): 159–168.
- Dorninger, D., Timischl, W. (1987). Geometrical constraints on Bennett’s predictions of chromosome order. Heredity 58: 321–325.
- Galeana-Sánchez, H., Rojas-Monroy, R., Sánchez-López, R., Villarreal-Valdés, J. I. (2019). Some conditions for the existence of Euler H-trails. Graphs Comb. 35(5): 1197–1208.
- Galeana-Sánchez, H., Sánchez-López, R. (2013). H-kernels in infinite digraphs. Graphs Comb. 29(4): 913–920.
- Guo, Z., Broersma, H., Li, B., Zhang, S. (2020). Almost Eulerian compatible spanning circuits in edge-colored graphs. Discrete Math. 344(1): 112174.
- Guo, Z., Li, B., Li, X., Zhang, S. (2020). Compatible spanning circuits in edge-colored graphs. Discrete Math. 343(7): 111908.
- Harary, F., Nash-Williams, C. S. J. (1965). On Eulerian and Hamiltonian graphs and line graphs. Can. Math. Bull. 8(6): 701–709.
- Kotzig, A. (1968). Moves without forbidden transitions in a graph. Math. Slovaca 18(1): 76–80.
- Linek, V., Sands, B. (1996). A note on paths in edge-coloured tournaments. Ars Combin. 44: 225–228.
- Sankararaman, S., Efrat, A., Ramasubramanian, S., Agarwal, P. K. (2014). On channel-discontinuity-constraint routing in wireless networks. Ad hoc Networks 13: 153–169.
- Szachniuk, M., De Cola, M. C., Felici, G., Blazewicz, J. (2014). The orderly colored longest path problem–a survey of applications and new algorithms. RAIRO Oper. Res. 48(1): 25–51.
- Szachniuk, M., Popenda, M., Adamiak, R. W., Blazewicz, J. (2009). An assignment walk through 3D NMR spectrum. Proceedings of the 2009 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology. Nashville, TN, USA: IEEE, pp. 215–219.
- Tutte, W. T. (1947). The factorization of linear graphs. J. London Math. Soc. 1(2): 107–111.