The following pages link to The \(L(2,1)\)-labelling of trees (Q2489954):
Displaying 27 items.
- Solutions of some \(L(2, 1)\)-coloring related open problems (Q274676) (← links)
- On backbone coloring of graphs (Q434190) (← links)
- A note on \(L (2, 1)\)-labelling of trees (Q511194) (← links)
- New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs (Q533885) (← links)
- The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs (Q548395) (← links)
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161) (← links)
- Labelling planar graphs without 4-cycles with a condition on distance two (Q947103) (← 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)
- The \(L(d,1)\)-number of powers of paths (Q1025974) (← links)
- Some results on distance two labelling of outerplanar graphs (Q1036889) (← links)
- The List \(L(2, 1)\)-labeling of planar graphs (Q1637136) (← links)
- Infinitely many trees with maximum number of holes zero, one, and two (Q1741707) (← links)
- The list \(L(2,1)\)-labeling of planar graphs with large girth (Q2039710) (← links)
- Optimal frequency assignment and planar list \(L(2, 1)\)-labeling (Q2084641) (← 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)
- Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees (Q2364083) (← links)
- A linear time algorithm for \(L(2,1)\)-labeling of trees (Q2375957) (← links)
- \((2,1)\)-total labelling of outerplanar graphs (Q2462398) (← links)
- An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees (Q3512458) (← links)
- Some classes of trees with maximum number of holes two (Q5154554) (← links)
- DISTANCE TWO LABELING ON THE SQUARE OF A CYCLE (Q5217048) (← links)
- OPTIMAL RADIOCOLORING OF TREES (Q5221077) (← links)
- \(L(p,q)\)-labeling and integer tension of a graph embedded on torus (Q5963610) (← links)
- A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable (Q5963659) (← links)
- (Q6039745) (← links)
