Approximate L(δ1,δ2,…,δt)‐coloring of trees and interval graphs

DOI10.1002/NET.20154MaRDI QIDQ3442863zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

\(L(\delta_{1}, \delta_{2},\dots,\delta _{t})\)-coloringapproximation algorithmschannel assignmentinterval graphstreeswireless networks

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Recommendations

• Improved distributed algorithms for coloring interval graphs with application to multicoloring trees
• Improved distributed algorithms for coloring interval graphs with application to multicoloring trees
• Approximations for  -Colorings of Graphs
• scientific article; zbMATH DE number 1500531
• scientific article; zbMATH DE number 2086232

Cites work

• Graph Classes: A Survey
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 1303554 (Why is no real title available?)

Cited in

(9)

• 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
• Complexity of tree-coloring interval graphs equitably
• L(2,1)-labeling of interval graphs
• 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(3, 2, 1)-labeling problem of square of path
• Linear and cyclic distance-three labellings of trees
• \(\lambda\)-coloring matrogenic graphs

This page was built for publication: Approximate L(δ₁,δ₂,…,δ_t)‐coloring of trees and interval graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3442863)