Abstract
The anti-Ramsey number AR(K,F) is the largest color number in an edge-coloring of K that contains no rainbow copies of graphs in the family F. In this paper, we determine the exact value of the anti-Ramsey number for trees in a balanced complete tripartite graph.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
