Broersma–Hoede strongly graceful tree conjecture
A strongly graceful labeling is the strong graceful-labeling notion for trees used in the source. Broersma–Hoede conjecture. Every tree containing a perfect matching is strongly graceful. The source says that Wang and Yao proved this conjecture equivalent to the graceful tree conjecture; no resolution of either conjecture is supplied here.
References
Primary source
Bing Yao, Chao Yang, Xia Liu, Fei Ma, Jing Su, Hui Sun, Xiaohui Zhang and Yarong Mu, “Strings And Colorings Of Topological Coding Towards Asymmetric Topology Cryptography”, arXiv:2209.15312 (2022).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.