Pages that link to "Item:Q491602"
From MaRDI portal
The following pages link to A lower bound for radio \(k\)-chromatic number (Q491602):
Displaying 17 items.
- On the radio number of square of graphs (Q324962) (← links)
- Radio graceful Hamming graphs (Q339492) (← links)
- A lower bound technique for radio \(k\)-coloring (Q512555) (← 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)
- Antipodal radio labelling of full binary trees (Q2039697) (← links)
- A note on the triameter of graphs (Q2065800) (← links)
- Radio \(k\)-chromatic number of full \(m\)-ary trees (Q2075390) (← links)
- Triameter of graphs (Q2227115) (← links)
- Optimal radio labellings of block graphs and line graphs of trees (Q2235749) (← links)
- Radio fuzzy graphs and assignment of frequency in radio stations (Q2322763) (← 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)
- 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)
