The following pages link to (Q3052501):
Displaying 12 items.
- \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs (Q436601) (← links)
- \(L(p,q)\)-labeling of digraphs (Q1026134) (← links)
- On \(L(d,1)\)-labelings of graphs (Q1567607) (← links)
- Is there any polynomial upper bound for the universal labeling of graphs? (Q1680487) (← links)
- \(L(p,q)\)-labeling of sparse graphs (Q1956243) (← links)
- \((p,1)\)-total labelling of graphs (Q2467731) (← links)
- L(2,1)-Labeling of Unigraphs (Q2999333) (← links)
- (Q3132587) (← links)
- (Q3501345) (← links)
- (Q4612382) (← links)
- (Q4657607) (← links)
- (Q5468089) (← links)