Two theorems on graceful trees
From MaRDI portal
Publication:599066
DOI10.1016/0012-365X(79)90016-5zbMath0414.05019MaRDI QIDQ599066
Publication date: 1979
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (16)
On Additive Bases and Harmonious Graphs ⋮ 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 ⋮ Unnamed Item ⋮ The subdivision graph of a graceful tree is a graceful tree ⋮ Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees ⋮ Products of graceful trees ⋮ On k-sequential and other numbered graphs ⋮ Unnamed Item ⋮ Graceful wind chimes ⋮ Binomial trees are graceful ⋮ Products of graceful bipartite graphs ⋮ Embedding an arbitrary tree in a graceful tree ⋮ Expanding graceful trees ⋮ A substitution theorem for graceful trees and its applications
Cites Work
This page was built for publication: Two theorems on graceful trees
