Pages that link to "Item:Q602756"

The following pages link to \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (Q602756):

Displaying 8 items.

• Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
• On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs (Q1944116) (← links)
• Computing \(L(p, 1)\)-labeling with combined parameters (Q2232248) (← links)
• Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
• \( L ( 2 , 1 )\)-labeling of disk intersection graphs (Q2306585) (← links)
• Determining the \(L(2,1)\)-span in polynomial space (Q2446848) (← links)
• Computing L(p,1)-Labeling with Combined Parameters (Q5049996) (← links)
• On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs (Q5963630) (← links)