Frequency channel assignment on planar networks
From MaRDI portal
(Redirected from Frequency channel assignment on planar networks)
Recommendations
Cited in
(20)- List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
- Distance constrained labelings of \(K_{4}\)-minor free graphs
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
- Frequency assignment problem in networks with limited spectrum
- \(L(h,1)\)-labeling subclasses of planar graphs
- L(p,q) labeling of d-dimensional grids
- (d,1)-total labelling of planar graphs with large girth and high maximum degree
- Coloring squares of planar graphs with girth six
- Labeling planar graphs with a condition at distance two
- A survey on the distance-colouring of graphs
- Real Number Channel Assignments for Lattices
- On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations
- A Hamiltonian approach to the assignment of non-reusable frequencies
- Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6
- List injective colorings of planar graphs
- List injective coloring of planar graphs with girth g 6
- The distance coloring of graphs
- Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies
- List 2-distance coloring of planar graphs
- Graph labellings with variable weights, a survey
This page was built for publication: Frequency channel assignment on planar networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411405)
