Sorry, we couldn’t find any results for “k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4.”.

Double check your search request for any spelling errors or try a different search term.