Funder
National Science Foundation
Indian Institute of Science
Science and Engineering Research Board
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference20 articles.
1. Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs;Balogh;European J. Combin.,2017
2. Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees;Bertossi;J. Parallel Distrib. Comput.,2002
3. L.S. Chandran, A. Das, D. Issac, E.J. van Leeuwen, Algorithms and bounds for very strong rainbow coloring, in: LATIN 2018, 2018, pp. 625–639.
4. Long rainbow paths and rainbow cycles in edge colored graphs - a survey;Chen;Appl. Math. Comput.,2018
5. A Simple linear time recognition of unit interval graphs;Corneil;Inform. Process. Lett.,1995