The following pages link to Radio number for trees (Q2469993):
Displaying 37 items.
- Radio mean labeling of a graph (Q322022) (← links)
- Radio numbers of some caterpillars (Q324983) (← links)
- Radio secure number of a graph (Q327660) (← links)
- Radio graceful Hamming graphs (Q339492) (← 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)
- 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 numbers of certain \(m\)-distant trees (Q2018964) (← 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)
- 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)
- On the radio \(k\)-chromatic number of some classes of trees (Q2657544) (← links)
- The radio number of standard caterpillars (Q2828956) (← links)
- Distance three labellings for <i>K</i> <sub> <i>n</i> </sub>×<i>K</i> <sub>2</sub> (Q2855724) (← links)
- Upper bounds on the radio number of some trees (Q2879555) (← links)
- Radio number of ladder graphs (Q3101605) (← links)
- Hole: An Emerging Character in the Story of Radio k-Coloring Problem (Q4555205) (← links)
- Radio $k$-labeling of paths (Q5164256) (← links)
- Distance edge coloring and collision‐free communication in wireless sensor networks (Q5326804) (← 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)
- Radio number of trees (Q5890939) (← links)
- Radio number of trees (Q5892342) (← 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)
