Pages that link to "Item:Q837161"

The following pages link to An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161):

Displaying 4 items.

• Distance three labelings of trees (Q415278) (← links)
• New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs (Q533885) (← links)
• \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (Q602756) (← links)
• A linear time algorithm for \(L(2,1)\)-labeling of trees (Q2375957) (← links)