Abstract
For a fixed graph $H$, what is the smallest number of colors $C$ such that there is a proper edge-coloring of the complete graph $K_n$ with $C$ colors containing no two vertex-disjoint color-isomor...
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
