\(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\)

From MaRDI portal

(Redirected from Publication:602756)
\(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=%5C(k-L(2,1)%5C)-labelling_for_planar_graphs_is_NP-complete_for_%5C(k%5Cgeq_4%5C)&oldid=63062403"