All trees of diameter five are graceful
From MaRDI portal
The paper adds a small step to the Ringel-Kotzig conjecture, which asserts that all trees are graceful, in proving that all trees of diameter 5 are graceful. Main tool is a shifting procedure transferring a graceful tree into another graceful tree, which is also useful to give a new proof for the gracefulness of trees of diameter 4.
Recommendations
Cited in
(28)- Trees having an even or quasi even degree sequence are graceful
- Some graceful lobsters with all three types of branches incident on the vertices of the central path
- Some graceful three distant trees by component moving operation
- Graceful labeling for mushroom trees
- Any tree with m edges can be embedded in a graceful tree with less than 4m edges and in a graceful planar graph
- Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees
- On 0-rotatable graceful caterpillars
- A new class of graceful rooted trees
- scientific article; zbMATH DE number 4174979 (Why is no real title available?)
- Generating graceful trees from caterpillars by recursive attachment
- A survey on the existence ofG-Designs
- scientific article; zbMATH DE number 17650 (Why is no real title available?)
- scientific article; zbMATH DE number 568853 (Why is no real title available?)
- scientific article; zbMATH DE number 1547752 (Why is no real title available?)
- Some new graceful generalized classes of diameter six trees
- scientific article; zbMATH DE number 7386901 (Why is no real title available?)
- scientific article; zbMATH DE number 7595319 (Why is no real title available?)
- A class of diameter six trees exhibiting graceful labeling
- Almost all trees are almost graceful
- Recent developments on gracefulness of graphs. A survey complemented with chessboard representations
- Binomial trees are graceful
- Graceful pairings
- On graceful spider graphs with at most four legs of lengths greater than one
- Graceful labelling: state of the art, applications and future directions
- All arbitrarily fixed generalized banana trees are graceful
- Embedding an arbitrary tree in a graceful tree
- Graceful lobsters obtained by partitioning and component moving of branches of diameter four trees
- Counting graceful labelings of trees: a theoretical and empirical study
This page was built for publication: All trees of diameter five are graceful
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5936024)
