Relaxed graceful labellings of trees
From MaRDI portal
Publication:5954317
zbMath0981.05089MaRDI QIDQ5954317
Publication date: 7 February 2002
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/121635
Related Items (10)
Any tree with \(m\) edges can be embedded in a graceful tree with less than \(4m\) edges and in a graceful planar graph ⋮ Computer search for graceful labeling: a survey ⋮ Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees ⋮ Almost all trees are almost graceful ⋮ Binomial trees are graceful ⋮ Graceful labelling: state of the art, applications and future directions ⋮ Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) ⋮ Improved bounds for relaxed graceful trees ⋮ Embedding an arbitrary tree in a graceful tree ⋮ New attack on Kotzigs conjecture
This page was built for publication: Relaxed graceful labellings of trees