Short odd cycles in 4-chromatic graphs

✍ Scribed by Nilli, A.

• Publisher: John Wiley and Sons
• Year: 1999
• Tongue: English
• Weight: 163 KB
• Volume: 31
• Category: Article
• ISSN: 0364-9024
• DOI: 10.1002/(sici)1097-0118(199906)31:2<145::aid-jgt7>3.0.co;2-e

✦ Synopsis

It is shown that any 4-chromatic graph on n vertices contains an odd cycle of length smaller than √ 8n.