Pages that link to "Item:Q4621302"
From MaRDI portal
The following pages link to A new graph radio k-coloring algorithm (Q4621302):
Displaying 4 items.
- On characterizing radio \(k\)-coloring problem by path covering problem (Q488288) (← links)
- Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies (Q849634) (← links)
- A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number (Q2012891) (← links)
- Hole: An Emerging Character in the Story of Radio k-Coloring Problem (Q4555205) (← links)
