Pages that link to "Item:Q894561"

The following pages link to \(L(0,1)\)-labelling of permutation graphs (Q894561):

Displaying 7 items.

• \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs (Q2018666) (← links)
• Distance two surjective labelling of paths and interval graphs (Q2045355) (← links)
• On \(L(2,1)\)-coloring split permutation graphs (Q2918470) (← links)
• L(3,2,1)-Labeling problems on trapezoid graphs (Q5025142) (← links)
• L(2,1,1)-labeling of interval graphs (Q6107729) (← links)
• \(L(3, 2, 1)\)-labeling problem of square of path (Q6545051) (← links)
• Minimization of span in \(L(3,1)\)-labeling for a particular type of intersection graphs (Q6608601) (← links)