Pages that link to "Item:Q408175"

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

Displaying 10 items.

• \((2,1)\)-total labeling of a class of subcubic graphs (Q324977) (← links)
• The \(L(h,1,1)\)-labelling problem for trees (Q976152) (← links)
• Computational complexity of distance edge labeling (Q1647838) (← links)
• \((p,q)\)-total labeling of complete graphs (Q1956251) (← 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)
• The (p,q)-total Labeling Problem for Trees (Q3060760) (← links)
• (Q3385950) (← links)
• Counting Unlabelled Subtrees of a Tree is #P-complete (Q4504966) (← links)
• A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable (Q5963659) (← links)