Optimal channel assignment and L(p,1)-labeling
From MaRDI portal
Publication:1630278
DOI10.1007/S10898-018-0647-9zbMATH Open1412.90161OpenAlexW2796048330WikidataQ130043915 ScholiaQ130043915MaRDI QIDQ1630278FDOQ1630278
Authors: Junlei Zhu, Yuehua Bu, Miltiades P. Pardalos, Bin Liu, Hongwei Du, Huijuan Wang 
Publication date: 7 December 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0647-9
Recommendations
- \(L(p,q)\)-label coloring problem with application to channel allocation
- Tight lower bound for the channel assignment problem
- Tight lower bound for the channel assignment problem
- Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs
- An Asymptotic Approach to the Channel Assignment Problem
- Approximation algorithms for channel assignment with constraints
- scientific article; zbMATH DE number 1522941
- An approximation algorithm for channel assignment with certain constraints
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
- An exact algorithm for the channel assignment problem
Cites Work
- Graph theory
- \(T\)-colorings of graphs: recent results and open problems
- Labelling Graphs with a Condition at Distance 2
- An optimal square coloring of planar graphs
- A bound on the chromatic number of the square of a planar graph
- An improved bound on 2-distance coloring plane graphs with girth 5
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- Coloring the square of a planar graph
- The $L(2,1)$-Labeling Problem on Graphs
- Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\)
- Bounds for the dichromatic number of a generalized lexicographic product of digraphs
- On \(L(d,1)\)-labelings of graphs
- On the \(L(p,1)\)-labelling of graphs
- Labeling planar graphs with a condition at distance two
- Griggs and Yeh's conjecture and \(L(p,1)\)-labelings
- Strong edge-coloring of subcubic planar graphs
- Radio k-chromatic number of cycles for large k
- \(b\)-chromatic sum of a graph
- A note on 3-choosability of plane graphs under distance restrictions
- Labeling planar graphs without 4,5-cycles with a condition on distance two
- The \(L(p, q)\)-labelling of planar graphs without 4-cycles
Cited In (9)
- Optimal channel assignment with list-edge coloring
- On the \(L(p,1)\)-labelling of graphs
- The list \(L(2,1)\)-labeling of planar graphs with large girth
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
- \(L(h,1)\)-labeling subclasses of planar graphs
- On the span in channel assignment problems: Bounds, computing and counting
- Optimal frequency assignment and planar list \(L(2, 1)\)-labeling
- On \(L (p, q)\)-labelling of planar graphs without cycles of length four
- Title not available (Why is that?)
This page was built for publication: Optimal channel assignment and \(L(p,1)\)-labeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1630278)
