Abstract
AbstractLi et al. (Discrete Math 310 (2010), 3579–3583) asked how long the longest monochromatic cycle in a 2‐edge‐colored graph G with minimum degree at least could be. In this article, an answer is given for all to an asymptotic form of their question.
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
