Pages that link to "Item:Q1883626"

The following pages link to Cyclic labellings with constraints at two distances (Q1883626):

Displaying 13 items.

• Locally constrained graph homomorphisms -- structure, complexity, and applications (Q458463) (← links)
• The minimum span of \(L(2,1)\)-labelings of generalized flowers (Q479033) (← links)
• Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) (← links)
• 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)
• Distance two edge labelings of lattices (Q1956249) (← links)
• Multiple \(L(j,1)\)-labeling of the triangular lattice (Q2015807) (← links)
• On a distance-constrained graph labeling to model cooperation (Q2243133) (← links)
• Circular \(L(j,k)\)-labeling number of direct product of path and cycle (Q2444141) (← links)
• Recent progress in mathematics and engineering on optimal graph labellings with distance conditions (Q2471056) (← links)
• Distance Constrained Labelings of Trees (Q3502639) (← links)
• Graph labeling and radio channel assignment (Q4242956) (← links)
• The edge span of distance two labellings of graphs (Q5928417) (← links)