Approximate L(δ1,δ2,…,δt)‐coloring of trees and interval graphs
From MaRDI portal
Publication:3442863
DOI10.1002/net.20154zbMath1117.05036OpenAlexW4239753137MaRDI QIDQ3442863
Alan A. Bertossi, Cristina M. Pinotti
Publication date: 23 May 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20154
treeschannel assignmentapproximation algorithmsinterval graphswireless networks\(L(\delta_{1}, \delta_{2},\dots,\delta _{t})\)-coloring
Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (6)
\(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs ⋮ \(L(2,1)\)-labeling of interval graphs ⋮ Linear and cyclic distance-three labellings of trees ⋮ Labeling bipartite permutation graphs with a condition at distance two ⋮ L(3,2,1)-Labeling problems on trapezoid graphs ⋮ $L(3,2,1)$-labeling for Cylindrical grid: the cartesian product of a path and a cycle
Cites Work
This page was built for publication: Approximate L(δ1,δ2,…,δt)‐coloring of trees and interval graphs
