The subdivision graph of a graceful tree is a graceful tree

DOI10.1016/S0012-365X(97)00069-1zbMath0902.05063OpenAlexW2170457172MaRDI QIDQ1381864

Giorgio Ferrarese, Marco Burzio

Publication date: 10 December 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00069-1

zbMATH Keywords

graceful treesubdivision graph

Mathematics Subject Classification ID

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

Related Items (13)

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 ⋮ Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees ⋮ Unnamed Item ⋮ Binomial trees are graceful ⋮ Products of graceful bipartite graphs ⋮ Improved bounds for relaxed graceful trees ⋮ Strong labelings of linear forests ⋮ Embedding an arbitrary tree in a graceful tree ⋮ A substitution theorem for graceful trees and its applications ⋮ Graceful Labeling of Balanced Stars of Paths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two theorems on graceful trees
• The factorial representation of balanced labelled graphs
• A survey: Recent results, conjectures, and open problems in labeling graphs

This page was built for publication: The subdivision graph of a graceful tree is a graceful tree