The following pages link to (Q4650002):
Displaying 24 items.
- Radio mean labeling of a graph (Q322022) (← links)
- On the radio number of square of graphs (Q324962) (← links)
- On characterizing radio \(k\)-coloring problem by path covering problem (Q488288) (← links)
- A lower bound for radio \(k\)-chromatic number (Q491602) (← links)
- Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\) (Q539413) (← links)
- Optimal radio labellings of complete \(m\)-ary trees (Q968168) (← links)
- Antipodal number of full \(m\)-ary trees (Q1981781) (← links)
- Computing edge weights of magic labeling on rooted products of graphs (Q2004217) (← 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)
- Improved lower bounds for the radio number of trees (Q2220806) (← links)
- Optimal radio-\(k\)-labelings of trees (Q2225407) (← links)
- Optimal radio labellings of block graphs and line graphs of trees (Q2235749) (← links)
- Distance-constrained labeling of complete trees (Q2342628) (← links)
- ℓ-distant Hamiltonian walks in Cartesian product graphs (Q2851440) (← links)
- Hole: An Emerging Character in the Story of Radio k-Coloring Problem (Q4555205) (← links)
- A new graph radio k-coloring algorithm (Q4621302) (← 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)
- Multilevel Bandwidth and Radio Labelings of Graphs (Q5452169) (← links)
- Relationship between radio <i>k</i>-chromatic number of graphs and square graphs (Q5861707) (← links)
- Radio number for the Cartesian product of two trees (Q6184339) (← links)
- A different approach for multi-level distance labellings of path structure networks (Q6544864) (← links)
