The following pages link to (Q5401064):
Displaying 10 items.
- Graceful labelling: state of the art, applications and future directions (Q691624) (← links)
- Counting graceful labelings of trees: a theoretical and empirical study (Q897585) (← links)
- Constraint-directed search for all-interval series (Q1699523) (← links)
- On the asymptotic growth of bipartite graceful permutations (Q1712524) (← links)
- A note on the number of graceful labellings of paths (Q1861279) (← links)
- The advantage of truncated permutations (Q2656968) (← links)
- Efficient methods of calculating the number of heapable permutations (Q2691575) (← links)
- (Q3077344) (← links)
- (Q4449187) (← links)
- Computer search for graceful labeling: a survey (Q5081235) (← links)