Pages that link to "Item:Q3512458"

The following pages link to An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees (Q3512458):

Displayed 2 items.

• Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) ‎ (← links)
• (2,1)-total labelling of trees with sparse vertices of maximum degree (Q976073) ‎ (← links)