Every tree is a subtree of graceful tree, graceful graph and alpha-labeled graph.

zbMATH Open1424.05264MaRDI QIDQ4598952FDOQ4598952

Authors: G. Sethuraman, P. Ragukumar 

Publication date: 15 December 2017

Recommendations

• Towards optimal embedding of an arbitrary tree in a graceful tree
• Embedding an arbitrary tree in a graceful tree
• A survey of graceful trees
• A substitution theorem for graceful trees and its applications
• scientific article

zbMATH Keywords

graceful labelinggraceful treegraceful tree conjecturegraceful tree embeddinggraph labeling

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (4)

• Any tree with \(m\) edges can be embedded in a graceful tree with less than \(4m\) edges and in a graceful planar graph
• Embedding an arbitrary tree in a graceful tree
• A substitution theorem for graceful trees and its applications
• Construction of \(\alpha\)-tree from smaller graceful trees

This page was built for publication: Every tree is a subtree of graceful tree, graceful graph and alpha-labeled graph.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598952)