[圖論]2題請教
1.Let G be a graph with mk edges.
Porve that if G is k-edge colorable, then there is a k-edge coloring f of G
in which every color class contains exactly m edges.
2.Prove that if a cbuic graph G has a hamilton cycle,
then G is 3-edge colorable.
感謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 114.27.26.146
討論串 (同標題文章)
完整討論串 (本文為第 1 之 2 篇)：
圖論
1
1