Binomial trees are graceful
From MaRDI portal
Recommendations
Cites work
- A dynamic survey of graph labeling
- All arbitrarily fixed generalized banana trees are graceful
- All trees of diameter five are graceful
- Decomposition of complete graphs and complete bipartite graphs into -labelled trees
- scientific article; zbMATH DE number 3821797 (Why is no real title available?)
- scientific article; zbMATH DE number 3670474 (Why is no real title available?)
- scientific article; zbMATH DE number 3458691 (Why is no real title available?)
- scientific article; zbMATH DE number 1195746 (Why is no real title available?)
- scientific article; zbMATH DE number 1228806 (Why is no real title available?)
- scientific article; zbMATH DE number 3218576 (Why is no real title available?)
- scientific article; zbMATH DE number 3308125 (Why is no real title available?)
- Relaxed graceful labellings of trees
- The gracefulness of a class of lobster trees
- The subdivision graph of a graceful tree is a graceful tree
- Trees having an even or quasi even degree sequence are graceful
- Two theorems on graceful trees
Cited in
(2)
This page was built for publication: Binomial trees are graceful
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154634)