Pages that link to "Item:Q2348054"

The following pages link to \((2,1)\)-total labeling of trees with large maximum degree (Q2348054):

Displaying 8 items.

• The \((p,q)\)-total labeling problem for trees (Q408175) (← links)
• (2,1)-total labelling of trees with sparse vertices of maximum degree (Q976073) (← links)
• \((2,1)\)-Total number of trees with maximum degree three (Q989489) (← links)
• A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\) (Q2359803) (← 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)
• (2,1)-total labelling of planar graphs with large maximum degree (Q5069984) (← links)
• A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable (Q5963659) (← links)