graceful_labeling (352B)
1 # Graceful labeling 2 3 https://en.wikipedia.org/wiki/Graceful_labeling 4 5 - Vertices are labeled with distinct values in {0, ..., m} 6 - Thus, each edge has an absolute value difference of at least 1 and at most m 7 - A "graceful labeling" is one where each possible difference is achieved exactly once 8 9 Special cases: 10 11 - [graceful_tree] 12 13 Up: [graph_labeling]