Abstract

It is shown that any 4-chromatic graph on n vertices contains an odd cycle of length smaller than √8n. © 1999 John Wiley & Sons, Inc. J Graph Theory 31: 145–147, 1999

Full Text
Published version (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