Publication at Faculty of Mathematics and Physics |
2011
Abstract
An exponential algorithm for finding L(2, 1)-labelings of graphs is presented that improves upon the trivial one; for colors 0, 1, ..., 4 it works in time O(1.3006^n).
An exponential algorithm for finding L(2, 1)-labelings of graphs is presented that improves upon the trivial one; for colors 0, 1, ..., 4 it works in time O(1.3006^n).