The following pages link to (Q4733889):
Displaying 13 items.
- Graceful labelling: state of the art, applications and future directions (Q691624) (← links)
- Exact and approximate bandwidth (Q708223) (← links)
- Lattice bandwidth of random graphs (Q810061) (← links)
- On the problem of bandsize (Q1089353) (← links)
- Decompositions into linear forests and difference labelings of graphs (Q1327218) (← links)
- On the bandwidth of a Hamming graph (Q1400004) (← links)
- Bounding the bandwidths for graphs (Q1583541) (← links)
- Weak-quasi-bandwidth and forward-bandwidth of graphs (Q1919043) (← links)
- On the bandwidth of the Kneser graph (Q2357135) (← links)
- Why bandwidth selectors tend to choose smaller bandwidths, and a remedy (Q3034682) (← links)
- Linex discrepancy for bandwidth selection (Q4593831) (← links)
- (Q5038453) (← links)
- Computer search for graceful labeling: a survey (Q5081235) (← links)