scientific article; zbMATH DE number 17650
From MaRDI portal
Publication:3974978
[For the entire collection see Zbl 0726.00015.] The author uses an unusual definition of a graceful labeling of trees and gives a conjecture equivalent to the Ringel-Kotzig conjecture Every tree of order \(\geq 2\) is graceful.
Recommendations
- Almost all trees are almost graceful
- scientific article; zbMATH DE number 3849284
- scientific article; zbMATH DE number 790410
- scientific article; zbMATH DE number 1925192
- scientific article; zbMATH DE number 568853
- All trees of diameter five are graceful
- A survey of graceful trees
- scientific article; zbMATH DE number 1789795
- Gracefulness of a family of rooted trees
- All banana trees are graceful
Cited in
(7)- scientific article; zbMATH DE number 4174979 (Why is no real title available?)
- Bipartite labeling of trees with maximum degree three
- scientific article; zbMATH DE number 568853 (Why is no real title available?)
- Almost all trees are almost graceful
- Binomial trees are graceful
- Infinitely many equivalent versions of the graceful tree conjecture
- All trees of diameter five are graceful
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3974978)