Any tree with \(m\) edges can be embedded in a graceful tree with less than \(4m\) edges and in a graceful planar graph (Q2374164): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2016.07.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2509813051
@@ Property / OpenAlex ID: W2509813051 / rank @@
+Normal rank
@@ Property / cites work @@
+The subdivision graph of a graceful tree is a graceful tree
+Normal rank
@@ Property / cites work @@
+Q4221902
@@ Property / cites work: Q4221902 / rank @@
+Normal rank
@@ Property / cites work @@
+A dynamic survey of graph labeling
@@ Property / cites work: A dynamic survey of graph labeling / rank @@
+Normal rank
@@ Property / cites work @@
+All trees of diameter five are graceful
@@ Property / cites work: All trees of diameter five are graceful / rank @@
+Normal rank
@@ Property / cites work @@
+Q5345646
@@ Property / cites work: Q5345646 / rank @@
+Normal rank
@@ Property / cites work @@
+Two theorems on graceful trees
@@ Property / cites work: Two theorems on graceful trees / rank @@
+Normal rank
@@ Property / cites work @@
+Bipartite labelings of trees and the gracesize
@@ Property / cites work: Bipartite labelings of trees and the gracesize / rank @@
+Normal rank
@@ Property / cites work @@
+Relaxed graceful labellings of trees
@@ Property / cites work: Relaxed graceful labellings of trees / rank @@
+Normal rank