Pages that link to "Item:Q5920600"
From MaRDI portal
The following pages link to Labeling trees with a condition at distance two (Q5920600):
Displaying 24 items.
- \(L(p,2,1)\)-labeling of the infinite regular trees (Q393463) (← links)
- On critical trees labeled with a condition at distance two (Q556846) (← links)
- Linear and cyclic distance-three labellings of trees (Q741540) (← links)
- List version of \(L(d,s)\)-labelings (Q817777) (← links)
- A complete \(L (2, 1)\) span characterization for small trees (Q896092) (← links)
- Graph labellings with variable weights, a survey (Q967309) (← links)
- \(L(j,k)\)-labelling and maximum ordering-degrees for trees (Q968198) (← links)
- The \(L(h,1,1)\)-labelling problem for trees (Q976152) (← links)
- The \(L(d,1)\)-number of powers of paths (Q1025974) (← links)
- Labeling trees with a condition at distance two. (Q1402073) (← links)
- Facial \(L(2, 1)\)-edge-labelings of trees (Q1671360) (← links)
- \(L(j,k)\)-labeling numbers of square of paths (Q1680886) (← links)
- On a distance-constrained graph labeling to model cooperation (Q2243133) (← links)
- Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers (Q2253966) (← links)
- Distance-constrained labeling of complete trees (Q2342628) (← 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)
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions (Q2471056) (← links)
- \(L(1, 2)\)-edge-labelings for lattices (Q2514965) (← links)
- \(L(1,1)\)-labeling of direct product of cycles (Q2798315) (← links)
- <i>L</i>(1, 2)-labeling numbers on square of cycles (Q4956193) (← links)
- (Q5199530) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710822) (← links)
- \(L(j,k)\)-labeling number of Cartesian product of path and cycle (Q5963640) (← links)
