Approximate L(δ1,δ2,…,δt)‐coloring of trees and interval graphs
From MaRDI portal
Publication:3442863
DOI10.1002/net.20154zbMath1117.05036MaRDI 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
trees; channel assignment; approximation algorithms; interval graphs; wireless networks; \(L(\delta_{1}, \delta_{2},\dots,\delta _{t})\)-coloring
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
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, \(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)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs
Cites Work