Pages that link to "Item:Q5954317"
From MaRDI portal
The following pages link to Relaxed graceful labellings of trees (Q5954317):
Displaying 10 items.
- Graceful labelling: state of the art, applications and future directions (Q691624) (← links)
- Embedding an arbitrary tree in a graceful tree (Q726528) (← links)
- Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) (Q965963) (← links)
- Improved bounds for relaxed graceful trees (Q2014211) (← links)
- Any tree with \(m\) edges can be embedded in a graceful tree with less than \(4m\) edges and in a graceful planar graph (Q2374164) (← links)
- Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees (Q2409751) (← links)
- New attack on Kotzigs conjecture (Q5006581) (← links)
- Computer search for graceful labeling: a survey (Q5081235) (← links)
- Almost all trees are almost graceful (Q5128748) (← links)
- Binomial trees are graceful (Q5154634) (← links)