Towards optimal embedding of an arbitrary tree in a graceful tree

DOI10.1016/J.ENDM.2015.05.011zbMATH Open1347.05221OpenAlexW769014706MaRDI QIDQ324915FDOQ324915

Authors: G. Sethuraman, P. Ragukumar 

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.05.011

Recommendations

• Embedding an arbitrary tree in a graceful tree
• Optimal embedding of complete binary trees into lines and grids
• scientific article; zbMATH DE number 219230
• On optimal embeddings and trees
• scientific article; zbMATH DE number 125491
• On embedding graphs in trees
• Optimal two-sided embeddings of complete binary trees in rectangular grids
• Optimal Algorithms to Embed Trees in a Point Set
• Efficient Embeddings of Trees in Hypercubes
• On the complexity of tree embedding problems

zbMATH Keywords

graceful labelinggraceful treegraceful tree conjecturegraceful tree embeddinggraph labeling

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Every tree is a subtree of graceful tree, graceful graph and alpha-labeled graph.
• Title not available (Why is that?)
• 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
• On optimal embeddings and trees
• Embedding of signed graphs in graceful signed graphs.

This page was built for publication: Towards optimal embedding of an arbitrary tree in a graceful tree

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