Show that every graph with χ(G) = k, contains a cycle of length at least k

后端 未结 0 1791
伪装坚强ぢ
伪装坚强ぢ 2021-02-07 17:25

I know that any k-chromatic graph has at least k vertices of degree at least k−1 each. But how does this gurantees a cycle of length at least k.

相关标签:
回答
  • 消灭零回复
提交回复
热议问题