The following pages link to The \(L(2,1)\)-labelling of trees (Q2489954):
Displayed 6 items.
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161) (← links)
- Labelling planar graphs without 4-cycles with a condition on distance two (Q947103) (← links)
- The \(L(d,1)\)-number of powers of paths (Q1025974) (← links)
- Some results on distance two labelling of outerplanar graphs (Q1036889) (← links)
- \((2,1)\)-total labelling of outerplanar graphs (Q2462398) (← links)
- An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees (Q3512458) (← links)