Pages that link to "Item:Q5470805"
From MaRDI portal
The following pages link to Labelling Cayley Graphs on Abelian Groups (Q5470805):
Displaying 22 items.
- Linear and cyclic distance-three labellings of trees (Q741540) (← links)
- No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups (Q879397) (← links)
- Distance labellings of Cayley graphs of semigroups (Q906971) (← links)
- Optimal radio labellings of complete \(m\)-ary trees (Q968168) (← links)
- The \(L(h,1,1)\)-labelling problem for trees (Q976152) (← links)
- A distance-labelling problem for hypercubes (Q1005224) (← links)
- Silver cubes (Q1014825) (← links)
- \(L(h,k)\)-labelings of Hamming graphs (Q1025475) (← links)
- Distance-two labellings of Hamming graphs (Q1026152) (← links)
- \(L(2, 1)\)-labeling of circulant graphs (Q1630932) (← links)
- A channel assignment problem for optical networks modelled by Cayley graphs (Q1884990) (← links)
- The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups (Q1956236) (← links)
- Lambda number of the power graph of a finite group (Q2038885) (← links)
- Radio-\(k\)-labeling of cycles for large \(k\) (Q2143046) (← links)
- Distance-constrained labellings of Cartesian products of graphs (Q2231783) (← links)
- Path covering number and \(L(2,1)\)-labeling number of graphs (Q2446849) (← links)
- On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups (Q2512654) (← links)
- Channel assignment on Cayley graphs (Q3018071) (← links)
- Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey (Q3439628) (← links)
- L(3,1)-labeling of circulant graphs (Q5063266) (← links)
- (Q5091944) (← links)
- Radio $k$-labeling of paths (Q5164256) (← links)
