The following pages link to (Q3073573):
Displaying 29 items.
- Radio number for fourth power paths (Q258676) (← links)
- Radio mean labeling of a graph (Q322022) (← links)
- On the radio number of square of graphs (Q324962) (← links)
- Radio secure number of a graph (Q327660) (← links)
- Antipodal number of some powers of cycles (Q411663) (← links)
- On characterizing radio \(k\)-coloring problem by path covering problem (Q488288) (← links)
- A lower bound for radio \(k\)-chromatic number (Q491602) (← links)
- \(l(3,2,1)\)-labeling for the product of a complete graph and a cycle (Q514887) (← links)
- Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\) (Q539413) (← links)
- An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn (Q623146) (← links)
- Optimal radio labellings of complete \(m\)-ary trees (Q968168) (← links)
- Radio number for total graph of paths (Q1952708) (← links)
- Antipodal number of full \(m\)-ary trees (Q1981781) (← links)
- A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number (Q2012891) (← links)
- Radio \(k\)-chromatic number of full \(m\)-ary trees (Q2075390) (← links)
- Distance-constrained labeling of complete trees (Q2342628) (← links)
- Radio number for the product of a path and a complete graph (Q2352358) (← links)
- Further results on the radio number of trees (Q2413341) (← links)
- Radio labelings of distance graphs (Q2446877) (← links)
- Radio number for trees (Q2469993) (← 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)
- Relationship between radio <i>k</i>-chromatic number of graphs and square graphs (Q5861707) (← links)
- Radio number of trees (Q5890939) (← links)
- Radio number of trees (Q5892342) (← links)
- On radio \(k\)-labeling of the power of the infinite path (Q6161446) (← links)
- A linear algorithm for radio \(k\)-coloring of powers of paths having small diameters (Q6627041) (← links)
