The following pages link to \(L(3,2,1)\)-labeling of graphs (Q449571):
Displaying 41 items.
- \(L(3,2,1)\)-labeling of triangular and toroidal grids (Q301947) (← links)
- On \(L(k, k - 1, \ldots, 1)\) labeling of triangular lattice (Q324981) (← links)
- \(L(p,2,1)\)-labeling of the infinite regular trees (Q393463) (← links)
- Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids (Q396591) (← links)
- \(L(2,1)\)-labelings of subdivisions of graphs (Q472974) (← links)
- Labeling graphs with two distance constraints (Q998444) (← links)
- A distance-labelling problem for hypercubes (Q1005224) (← links)
- \(L(h,k)\)-labelings of Hamming graphs (Q1025475) (← links)
- \(L(p,q)\)-labeling of digraphs (Q1026134) (← links)
- On \(L(d,1)\)-labelings of graphs (Q1567607) (← links)
- \(L(2, 1)\)-labeling of circulant graphs (Q1630932) (← links)
- \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs (Q1680868) (← links)
- Frequency assignment problem in networks with limited spectrum (Q1788938) (← links)
- The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups (Q1956236) (← links)
- Distance two surjective labelling of paths and interval graphs (Q2045355) (← links)
- On a distance-constrained graph labeling to model cooperation (Q2243133) (← links)
- Distance-constrained labeling of complete trees (Q2342628) (← links)
- Optimal \(L(3, 2, 1)\)-labeling of triangular lattice (Q2357158) (← links)
- Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees (Q2364083) (← links)
- \( L ( p , q )\)-labelings of subdivisions of graphs (Q2659077) (← links)
- \(L(3, 2, 1)\)-labeling of banana trees (Q2678680) (← links)
- On some results for the \(L(2,1)\)-labeling on Cartesian sum graphs. (Q2828921) (← links)
- 3-equitable labelings of ladders and graphs related to cycles (Q2870961) (← links)
- On real number distance labelings of paths (Q2885010) (← links)
- \(L(p,q)\)-labeling of fullerene graphs (Q2990793) (← links)
- L(2,1)-Labeling of Unigraphs (Q2999333) (← links)
- (Q3052501) (← links)
- The \(L (3,2,1)\)-labeling of Goldberg snark graphs (Q3175333) (← links)
- (Q3501345) (← links)
- $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3 (Q3614202) (← links)
- The L(2,1)-labeling and operations of graphs (Q4590445) (← links)
- (Q4612382) (← links)
- (Q4657607) (← links)
- L(3,2,1)-Labeling problems on trapezoid graphs (Q5025142) (← links)
- $L(3,2,1)$-labeling for Cylindrical grid: the cartesian product of a path and a cycle (Q5208539) (← links)
- \(L(2,1)\)-labeling for brick product graphs (Q5963632) (← links)
- (Q6039745) (← links)
- L(2,1,1)-labeling of interval graphs (Q6107729) (← links)
- \(L(3,2,1)\) labeling of firecracker graph (Q6169599) (← links)
- \(L(3, 2, 1)\)-labeling problem of square of path (Q6545051) (← links)
- \(L(3, 2, 1)\)-labeling of certain planar graphs (Q6646440) (← links)
