Abstract
AbstractWe show that for every , there exists such that for every even , and every graph with vertices and minimum degree at least , each colouring of the edges of with three colours results in a monochromatic cycle of length .
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
