On Improved Exact Algorithms for L(2,1)-Labeling of Graphs
From MaRDI portal
Publication:3000491
DOI10.1007/978-3-642-19222-7_4zbMath1295.05205MaRDI 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
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Fast exact algorithm for \(L(2,1)\)-labeling of graphs, Distance three labelings of trees, On the number of 2-packings in a connected graph, On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs, Channel assignment via fast zeta transform, Colorings with few colors: counting, enumeration and combinatorial bounds, Determining the \(L(2,1)\)-span in polynomial space, Fast Exact Algorithm for L(2,1)-Labeling of Graphs
Cites Work