[理工] 台科大100離散
let G be a bipartite graph whose vertices are divided into two sets A and B,
where no two vertices in the same set are connected. Prove that if G contains
a Hamiltonian path, then the number of vertives in A and the number of
vertices in B differ by at most 1. (Hint:What is a Hamiltonian path?)
雖然這題有個提示不過還是不知道從哪裡開始證起@@"
--
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 114.34.232.57
推
01/05 20:10, , 1F
01/05 20:10, 1F
→
01/05 20:11, , 2F
01/05 20:11, 2F
→
01/05 23:05, , 3F
01/05 23:05, 3F