Exact Algorithms for L(2,1)-Labeling of Graphs
From MaRDI portal
Publication:3525597
DOI10.1007/978-3-540-74456-6_46zbMath1147.05310OpenAlexW1548106293MaRDI QIDQ3525597
Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
Publication date: 17 September 2008
Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_46
Analysis of algorithms and problem complexity (68Q25) Applications of graph theory (05C90) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
A linear time algorithm for \(L(2,1)\)-labeling of trees ⋮ \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles ⋮ Fast exact algorithm for \(L(2,1)\)-labeling of graphs ⋮ Exact algorithms for \(L(2,1)\)-labeling of graphs ⋮ Fast Exact Algorithm for L(2,1)-Labeling of Graphs ⋮ Modeling the packing coloring problem of graphs ⋮ Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds ⋮ Frequency assignment problem in networks with limited spectrum ⋮ \(L(2,1)\)-labeling for brick product graphs
This page was built for publication: Exact Algorithms for L(2,1)-Labeling of Graphs
