The following pages link to Distance three labelings of trees (Q415278):
Displaying 11 items.
- Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids (Q396591) (← links)
- Linear and cyclic distance-three labellings of trees (Q741540) (← links)
- Distance-constrained labellings of Cartesian products of graphs (Q2231783) (← links)
- Distance-constrained labeling of complete trees (Q2342628) (← links)
- Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees (Q2364083) (← links)
- The multi-level distance labeling for lobster tree (Q2915922) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710822) (← links)
- Automata, Languages and Programming (Q5716789) (← links)
- (Q5874489) (← links)
- Labeling trees with a condition at distance two (Q5920600) (← links)
- (Q6039745) (← links)