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
From MaRDI portal
Latest revision as of 02:50, 13 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Any tree with \(m\) edges can be embedded in a graceful tree with less than \(4m\) edges and in a graceful planar graph |
scientific article |
Statements
Any tree with \(m\) edges can be embedded in a graceful tree with less than \(4m\) edges and in a graceful planar graph (English)
0 references
14 December 2016
0 references
graceful tree
0 references
graceful tree conjecture
0 references
range-relaxed graceful labeling
0 references
