List version of \(L(d,s)\)-labelings

DOI10.1016/j.tcs.2005.09.032zbMath1152.05365OpenAlexW1991234184MaRDI QIDQ817777

Anja Kohl, Jens Schreyer, Margit Voigt, Zsolt Tuza

Publication date: 20 March 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.032

zbMATH Keywords

channel assignment problemlist coloring\(L(ds)\)-labeling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Reconfiguration of list \(L(2,1)\)-labelings in a graph

Cites Work

• Unnamed Item
• Unnamed Item
• A short proof of a conjecture on the \(T_r\)-choice number of even cycles
• List \(T\)-colorings of graphs
• \(T\)-choosability in graphs
• On \(L(d,1)\)-labelings of graphs
• A bound on the chromatic number of the square of a planar graph
• Labelling Graphs with a Condition at Distance 2
• Labeling Chordal Graphs: Distance Two Condition
• A Theorem about the Channel Assignment Problem
• Approximations for  -Colorings of Graphs
• The $L(2,1)$-Labeling Problem on Graphs

This page was built for publication: List version of \(L(d,s)\)-labelings