The following pages link to (Q4232883):
Displaying 14 items.
- Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies (Q849634) (← links)
- On Hamiltonian colorings for some graphs (Q1005245) (← links)
- Systems of distant representatives (Q1764814) (← links)
- On Hamiltonian colorings of graphs (Q1772412) (← links)
- Theory of computational complexity. Part 7. Transl. from the Russian (Q1781794) (← links)
- Radio and radial radio numbers of certain sunflower extended graphs (Q2119866) (← links)
- The dynamic frequency assignment problem (Q2378376) (← links)
- When the greedy algorithm fails (Q2386197) (← links)
- Radiocoloring in planar graphs: Complexity and approximations (Q2566036) (← links)
- Systems of pairs of \(q\)-distant representatives, and graph colorings (Q2577585) (← links)
- On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations (Q3464470) (← links)
- Hole: An Emerging Character in the Story of Radio k-Coloring Problem (Q4555205) (← links)
- Fixed-parameter complexity of \(\lambda\)-labelings (Q5948961) (← links)
- A study on avoiding RFI in the movement of robots via radio resolving number problem (Q6613051) (← links)
