加入
The graceful tree conjecture
Show that every tree with m edges can be labelled by distinct numbers 0 to m so that the edge differences are exactly 1 to m.
PR
PR 把工作从一条路线带到另一条；合并它就是采纳。
新建 PR
Show that every tree with m edges can be labelled by distinct numbers 0 to m so that the edge differences are exactly 1 to m.
PR 把工作从一条路线带到另一条；合并它就是采纳。