All trees of diameter five are graceful
From MaRDI portal
Publication:5936024
DOI10.1016/S0012-365X(00)00233-8zbMath0986.05088MaRDI QIDQ5936024
Publication date: 6 June 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (23)
Any tree with \(m\) edges can be embedded in a graceful tree with less than \(4m\) edges and in a graceful planar graph ⋮ Unnamed Item ⋮ Generating graceful trees from caterpillars by recursive attachment ⋮ A class of diameter six trees exhibiting graceful labeling ⋮ On 0-rotatable graceful caterpillars ⋮ Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees ⋮ Counting graceful labelings of trees: a theoretical and empirical study ⋮ Unnamed Item ⋮ A survey on the existence ofG-Designs ⋮ Unnamed Item ⋮ On graceful spider graphs with at most four legs of lengths greater than one ⋮ Binomial trees are graceful ⋮ Graceful labelling: state of the art, applications and future directions ⋮ All arbitrarily fixed generalized banana trees are graceful ⋮ Some graceful three distant trees by component moving operation ⋮ Embedding an arbitrary tree in a graceful tree ⋮ 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 ⋮ A new class of graceful rooted trees ⋮ Unnamed Item ⋮ Some new graceful generalized classes of diameter six trees ⋮ Graceful labeling for mushroom trees ⋮ Graceful lobsters obtained by partitioning and component moving of branches of diameter four trees
This page was built for publication: All trees of diameter five are graceful
