Pages that link to "Item:Q3000491"
From MaRDI portal
The following pages link to On Improved Exact Algorithms for L(2,1)-Labeling of Graphs (Q3000491):
Displaying 8 items.
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
- Distance three labelings of trees (Q415278) (← links)
- On the number of 2-packings in a connected graph (Q1761463) (← links)
- On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs (Q1944116) (← links)
- Channel assignment via fast zeta transform (Q1944122) (← links)
- Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)
- Determining the \(L(2,1)\)-span in polynomial space (Q2446848) (← links)
- Fast Exact Algorithm for L(2,1)-Labeling of Graphs (Q3010388) (← links)
