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

MaRDI QIDQ4598952zbMATH OpenFDO

Authors G. Sethuraman, P. Ragukumar

Publication date 15 December 2017

zbMATH Keywords

graceful labelinggraceful treegraceful tree conjecturegraceful tree embeddinggraph labeling

Mathematics Subject Classification ID

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

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 DE number 4214060

Cited in

(5)

• A substitution theorem for graceful trees and its applications
• The subdivision graph of a graceful tree is a graceful tree
• 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 -tree from smaller graceful trees
• Embedding an arbitrary tree in a graceful tree

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)