Pages that link to "Item:Q2364083"

The following pages link to Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees (Q2364083):

Displaying 11 items.

• The \((p,q)\)-total labeling problem for trees (Q408175) (← links)
• Distance three labelings of trees (Q415278) (← links)
• A note on \(L (2, 1)\)-labelling of trees (Q511194) (← links)
• A complete \(L (2, 1)\) span characterization for small trees (Q896092) (← links)
• The \(L(h,1,1)\)-labelling problem for trees (Q976152) (← links)
• The \(L(2,1)\)-labelling of trees (Q2489954) (← links)
• A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata (Q2830211) (← links)
• A characterization of L(2, 1)-labeling number for trees with maximum degree 3 (Q2983505) (← links)
• The (p,q)-total Labeling Problem for Trees (Q3060760) (← links)
• (Q3385950) (← links)
• (Q6039745) (← links)