The following pages link to Complexity of (p,1)-total labelling (Q967327):
Displayed 5 items.
- \((2,1)\)-total labeling of a class of subcubic graphs (Q324977) (← links)
- The \((p,q)\)-total labeling problem for trees (Q408175) (← links)
- \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (Q602756) (← links)
- Computational complexity of distance edge labeling (Q1647838) (← links)
- Facial \([r,s,t]\)-colorings of plane graphs (Q2416948) (← links)