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

DOI10.1007/978-3-540-74456-6_46MaRDI QIDQ3525597zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Exact algorithms for \(L(2,1)\)-labeling of graphs
• Fast exact algorithm for \(L(2,1)\)-labeling of graphs
• On improved exact algorithms for \(L(2,1)\)-labeling of graphs
• Fast exact algorithm for L(2,1)-labeling of graphs
• On the complexity of exact algorithm for L(2,1)-labeling of graphs

Cited in

(14)

• Frequency assignment problem in networks with limited spectrum
• On the complexity of exact algorithm for L(2,1)-labeling of graphs
• Modeling the packing coloring problem of graphs
• 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
• Colorings with few colors: counting, enumeration and combinatorial bounds
• scientific article; zbMATH DE number 7404291 (Why is no real title available?)
• scientific article; zbMATH DE number 5178701 (Why is no real title available?)
• Fast exact algorithm for L(2,1)-labeling of graphs
• Automata, Languages and Programming
• L(2,1)-labeling for brick product graphs
• \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\)
• Exact algorithms for \(L(2,1)\)-labeling of graphs

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

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