The following pages link to (Q3426085):
Displaying 19 items.
- 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)
- A lower bound technique for radio \(k\)-coloring (Q512555) (← 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)
- On Hamiltonian colorings for some graphs (Q1005245) (← 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)
- Radio \(k\)-chromatic number of full \(m\)-ary trees (Q2075390) (← links)
- Optimal radio-\(k\)-labelings of trees (Q2225407) (← links)
- On Hamiltonian Colorings of Trees (Q2795934) (← links)
- On Hamiltonian Colorings of Block Graphs (Q2803806) (← links)
- Hole: An Emerging Character in the Story of Radio k-Coloring Problem (Q4555205) (← links)
- Radio $k$-labeling of paths (Q5164256) (← links)
- Radio k-chromatic number of cycles for large k (Q5367524) (← 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)
- (Q6115897) (← links)
