Pages that link to "Item:Q989489"
From MaRDI portal
The following pages link to \((2,1)\)-Total number of trees with maximum degree three (Q989489):
Displayed 6 items.
- The \((p,q)\)-total labeling problem for trees (Q408175) (← 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)
- Facial \([r,s,t]\)-colorings of plane graphs (Q2416948) (← 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)