Pages that link to "Item:Q3639233"
From MaRDI portal
The following pages link to A Linear Time Algorithm for L(2,1)-Labeling of Trees (Q3639233):
Displaying 15 items.
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
- The \((p,q)\)-total labeling problem for trees (Q408175) (← links)
- Distance three labelings of trees (Q415278) (← links)
- \(L(2,1)\)-labeling of interval graphs (Q500005) (← links)
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (Q602756) (← links)
- On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs (Q714037) (← links)
- Injective colorings with arithmetic constraints (Q897262) (← links)
- \(L(2, 1)\)-labeling of circulant graphs (Q1630932) (← links)
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs (Q2018666) (← links)
- Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees (Q2364083) (← links)
- A linear time algorithm for \(L(2,1)\)-labeling of trees (Q2375957) (← links)
- Fast Exact Algorithm for L(2,1)-Labeling of Graphs (Q3010388) (← links)
- L(3,1)-labeling of circulant graphs (Q5063266) (← links)
- On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs (Q5963630) (← links)
