Another equivalent of the graceful tree conjecture
The well-known graceful tree conjecture says that the vertices of every tree \(T\) of order \(n\) can be labeled \(0,1,\ldots ,n-1\) so that, if \(l\) is the labeling, \(\{|l(y)-l(x)|: xy\in E(T)\}=\{1,2,\ldots ,n-1\}\). The authors set forth a stronger conjecture: every tree \(T\) of order \(n\) with a perfect matching \(M\) has a graceful labeling \(l\) such that, in addition, \(l(x)+l(y)=n-1\) whenever \(xy\in M\). It is proved that both conjectures are equivalent. Some transformations that might be useful in a possible proof of the second conjecture are considered and some families of strongly graceful trees are presented.
- The joint sum of graceful trees
- 0-centred and 0-ubiquitously graceful trees.
- Improved bounds for relaxed graceful trees
- On \(\alpha\)-labellings of lobsters and trees with a perfect matching
- On 0-rotatable graceful caterpillars
- Some results on graceful graphs
- A proof of the modular edge-graceful trees conjecture
- Strongly gracefulness of natural number sequence lobster and its series tree
- A note on strongly graceful trees.
- scientific article; zbMATH DE number 3891430 (Why is no real title available?)
- Sailing towards, and then against, the graceful tree conjecture: some promisuous results
- scientific article; zbMATH DE number 5305238 (Why is no real title available?)
- Gracefulness of a family of rooted trees
- scientific article; zbMATH DE number 4070956 (Why is no real title available?)
- Strongly graceful trees with perfect matchings and diameters not greater than 7
- A survey of graceful trees
- Infinitely many equivalent versions of the graceful tree conjecture
- scientific article; zbMATH DE number 2235053 (Why is no real title available?)
- On a combinatorial problem
This page was built for publication: Another equivalent of the graceful tree conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2761056)
