The following pages link to (Q4536372):
Displayed 10 items.
- \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (Q602756) (← links)
- Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies (Q849634) (← links)
- Distance constrained labelings of planar graphs with no short cycles (Q967308) (← links)
- Graph labellings with variable weights, a survey (Q967309) (← links)
- Distance constrained labelings of \(K_{4}\)-minor free graphs (Q1045067) (← links)
- Algorithms for graphs with small octopus (Q1421464) (← links)
- Labeling planar graphs with a condition at distance two (Q2461777) (← links)
- Radiocoloring in planar graphs: Complexity and approximations (Q2566036) (← links)
- On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations (Q3464470) (← links)
- OPTIMAL RADIOCOLORING OF TREES (Q5221077) (← links)