Pages that link to "Item:Q2471056"

The following pages link to Recent progress in mathematics and engineering on optimal graph labellings with distance conditions (Q2471056):

Displaying 23 items.

• On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs (Q714037) (← links)
• Graph labellings with variable weights, a survey (Q967309) (← links)
• \(L(j,k)\)-labeling numbers of square of paths (Q1680886) (← links)
• Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs (Q1752619) (← links)
• Group path covering and distance two labeling of graphs (Q1944096) (← links)
• Distance two edge labelings of lattices (Q1956249) (← links)
• Multiple \(L(j,1)\)-labeling of the triangular lattice (Q2015807) (← links)
• On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice (Q2343988) (← links)
• 2-distance colorings of some direct products of paths and cycles (Q2346336) (← links)
• \(L(j, k)\)-number of direct product of path and cycle (Q2391993) (← links)
• Circular \(L(j,k)\)-labeling number of direct product of path and cycle (Q2444141) (← links)
• On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice (Q2445232) (← links)
• \(L(1, 2)\)-edge-labelings for lattices (Q2514965) (← links)
• (Q2752161) (← links)
• Minimum Span of No-Hole (<i>r</i>+1)-Distant Colorings (Q2753531) (← links)
• Distance three labellings for <i>K</i> _<i>n</i>×<i>K</i> ₂ (Q2855724) (← links)
• <i>L</i>(1, 2)-labeling numbers on square of cycles (Q4956193) (← links)
• On (<i>s,t</i>)-relaxed <i>L</i>(1,1)-labelling of trees (Q4976318) (← links)
• THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE (Q5016312) (← links)
• On circular-<i>L</i>(2, 1)-labellings of products of graphs (Q5259049) (← links)
• \(L(p,q)\)-labeling and integer tension of a graph embedded on torus (Q5963610) (← links)
• On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs (Q5963630) (← links)
• \(L(j,k)\)-labeling number of Cartesian product of path and cycle (Q5963640) (← links)