The following pages link to (Q4897468):
Displayed 10 items.
- A lower bound for radio \(k\)-chromatic number (Q491602) (← links)
- An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn (Q623146) (← links)
- Antipodal number of full \(m\)-ary trees (Q1981781) (← links)
- Antipodal radio labelling of full binary trees (Q2039697) (← links)
- Radio \(k\)-chromatic number of full \(m\)-ary trees (Q2075390) (← links)
- Radio-\(k\)-labeling of cycles for large \(k\) (Q2143046) (← links)
- Upper bound for radio -chromatic number of graphs in connection with partition of vertex set (Q5154598) (← links)
- Radio $k$-labeling of paths (Q5164256) (← links)
- Radio k-chromatic number of cycles for large k (Q5367524) (← links)
- Relationship between radio <i>k</i>-chromatic number of graphs and square graphs (Q5861707) (← links)