The following pages link to (Q2718341):
Displaying 13 items.
- On characterizing radio \(k\)-coloring problem by path covering problem (Q488288) (← links)
- A lower bound for radio \(k\)-chromatic number (Q491602) (← links)
- An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn (Q623146) (← links)
- Hamiltonian colorings of graphs (Q1763479) (← 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)
- Radio labelings of distance graphs (Q2446877) (← links)
- Radio k-Labelings for Cartesian Products of Graphs (Q3439363) (← links)
- Hole: An Emerging Character in the Story of Radio k-Coloring Problem (Q4555205) (← links)
- Radio $k$-labeling of paths (Q5164256) (← links)
- Relationship between radio <i>k</i>-chromatic number of graphs and square graphs (Q5861707) (← links)
- (Q6113433) (← links)