加入
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.
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.
shoal-catalog changed this problem (d1cbb60b3b19). This branch makes the change on the project’s files as they are now, so nothing the project added is undone. Merge what still holds.