寄托天下
查看: 1284|回复: 0

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

Rank: 2

声望
0
寄托币
229
注册时间
2010-6-11
精华
0
帖子
13
发表于 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.

使用道具 举报

RE: help with graph theory proof! [修改]

问答
Offer
投票
面经
最新
精华
转发
转发该帖子
help with graph theory proof!
https://bbs.gter.net/thread-1236643-1-1.html
复制链接
发送
回顶部