help with graph theory proof! [复制链接]

Rank: 2

电梯直达

楼主

发表于 2011-3-1 10:09:01 |只看该作者 |倒序浏览

Let T be a tree with n vertices and maximum degree k. Prove that the longest path in T has at most n-k+1 edges.

0 0

转发该帖子

help with graph theory proof!

https://bbs.gter.net/thread-1236643-1-1.html

复制链接

发送