Pages that link to "Item:Q1884990"
From MaRDI portal
The following pages link to A channel assignment problem for optical networks modelled by Cayley graphs (Q1884990):
Displaying 18 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)
- 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)
- An optimal square coloring of planar graphs (Q1928491) (← links)
- The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups (Q1956236) (← links)
- Antipodal radio labelling of full binary trees (Q2039697) (← links)
- Radio-\(k\)-labeling of cycles for large \(k\) (Q2143046) (← links)
- Improved lower bounds for the radio number of trees (Q2220806) (← links)
- Optimal radio labellings of block graphs and line graphs of trees (Q2235749) (← 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)
- Radio $k$-labeling of paths (Q5164256) (← links)
- Polyhedral studies for minimum‐span graph labelling with integer distance constraints (Q5438551) (← links)
- Radio number for the Cartesian product of two trees (Q6184339) (← links)
