1. Albert, M., Frieze, A., Reed, B.: Multicolored Hamilton cycles. Electron. J. Combin.2, #R10 (1995)
2. Allender, E., Bauland, M., Immerman, N., Schnoor, H., Vollmer, H.: The complexity of satisfiability problems: refining Schaefer’s Theorem. In: Mathematical Foundations of Computer Science 2005: 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29–September 2, 2005. Proceedings, Jȩdrzejowicz, J., Szepietowski, A. (Eds.), Springer, Berlin, 2005, pp. 71–82. doi: 10.1007/11549345_8
3. Babu, J., Chandran, S., Rajendraprasad, D.: Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs. Eur. J. Combin. 48, 110–126 (2015). doi: 10.1016/j.ejc.2015.02.014
4. Ben Slimane, J., Schott, R., Song, Y.-Q., Staples, G.S., Tsiontsiou, E.: Operator calculus algorithms for multi-constrained paths. Int. J. Math. Comput. Sci. 10, 69–104 (2015). http://ijmcs.future-in-tech.net/10.1/R-Jamila . Accessed 19 Nov 2016
5. Broersma, H.J., Li, X.L., Woeginger, G., Zhang, S.G.: Paths and cycles in colored graphs. Aust. J. Combin. 31, 297–309 (2005)