On Improved Exact Algorithms for L(2,1)-Labeling of Graphs

DOI10.1007/978-3-642-19222-7_4zbMath1295.05205OpenAlexW2204989461MaRDI QIDQ3000491

Paweł Rzążewski, Konstanty Junosza-Szaniawski

Publication date: 19 May 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19222-7_4

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Colorings with few colors: counting, enumeration and combinatorial bounds ⋮ Fast exact algorithm for \(L(2,1)\)-labeling of graphs ⋮ Distance three labelings of trees ⋮ On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs ⋮ Channel assignment via fast zeta transform ⋮ Determining the \(L(2,1)\)-span in polynomial space ⋮ Fast Exact Algorithm for L(2,1)-Labeling of Graphs ⋮ On the number of 2-packings in a connected graph

Cites Work

• Exact algorithms for \(L(2,1)\)-labeling of graphs
• Fixed-parameter complexity of \(\lambda\)-labelings

This page was built for publication: On Improved Exact Algorithms for L(2,1)-Labeling of Graphs