Pages that link to "Item:Q408175"

The following pages link to The \((p,q)\)-total labeling problem for trees (Q408175):

Displaying 5 items.

• \((2,1)\)-total labeling of a class of subcubic graphs (Q324977) (← links)
• Computational complexity of distance edge labeling (Q1647838) (← links)
• \((2,1)\)-total labeling of trees with large maximum degree (Q2348054) (← links)
• A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\) (Q2359803) (← links)
• A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable (Q5963659) (← links)