L(2, 1, 1)-Labeling Is NP-Complete for Trees Petr A. Golovach 1 , Bernard Lidick´y 2 , and Dani¨el Paulusma 1 University of Bergen, Bergen, Norway

First Page		Document Content
Date: 2014-08-22 14:45:42		L(2, 1, 1)-Labeling Is NP-Complete for Trees Petr A. Golovach 1 , Bernard Lidick´y 2 , and Dani¨el Paulusma 1 University of Bergen, Bergen, Norway Add to Reading List Source URL: orion.math.iastate.edu Download Document from Source Website File Size: 231,68 KB Share Document on Facebook