Optimal channel assignment and \(L(p,1)\)-labeling
From MaRDI portal
Publication:1630278
DOI10.1007/S10898-018-0647-9zbMath1412.90161OpenAlexW2796048330MaRDI QIDQ1630278
Junlei Zhu, Bin Liu, Miltiades P. Pardalos, Yuehua Bu, Hongwei David Du, Hui-Juan 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
Related Items (3)
On \(L (p, q)\)-labelling of planar graphs without cycles of length four ⋮ The list \(L(2,1)\)-labeling of planar graphs with large girth ⋮ Optimal frequency assignment and planar list \(L(2, 1)\)-labeling
Cites Work
- Unnamed Item
- An improved bound on 2-distance coloring plane graphs with girth 5
- Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\)
- The \(L(p, q)\)-labelling of planar graphs without 4-cycles
- \(T\)-colorings of graphs: recent results and open problems
- On \(L(d,1)\)-labelings of graphs
- An optimal square coloring of planar graphs
- Labeling planar graphs with a condition at distance two
- On the \(L(p,1)\)-labelling of graphs
- A bound on the chromatic number of the square of a planar graph
- b-Chromatic sum of a graph
- Labeling Planar Graphs without 4,5-Cycles with a Condition on Distance Two
- Griggs and Yeh's Conjecture and $L(p,1)$-labelings
- A note on 3-choosability of plane graphs under distance restrictions
- Strong edge-coloring of subcubic planar graphs
- Bounds for the dichromatic number of a generalized lexicographic product of digraphs
- Labelling Graphs with a Condition at Distance 2
- 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
- Radio k-chromatic number of cycles for large k
This page was built for publication: Optimal channel assignment and \(L(p,1)\)-labeling
