The following pages link to On \(L(d,1)\)-labelings of graphs (Q1567607):
Displayed 11 items.
- \(L(2,1)\)-labelings of Cartesian products of two cycles (Q2492228) (← links)
- A survey on labeling graphs with a condition at distance two (Q2497501) (← links)
- L(1,1)-Labeling of direct product of cycles (Q2798315) (← links)
- Distance Constrained Labelings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-minor Free Graphs (Q3439631) (← links)
- Distance Constrained Labelings of Trees (Q3502639) (← links)
- An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees (Q3512458) (← links)
- <i>L</i>(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs (Q5097782) (← links)
- On the<i>L</i>(2, 1)-labelling of block graphs (Q5391500) (← links)
- Injective coloring of planar graphs (Q5902135) (← links)
- \(L(p,q)\)-labeling and integer tension of a graph embedded on torus (Q5963610) (← links)
- (Q6184161) (← links)