Pages that link to "Item:Q1944116"
From MaRDI portal
The following pages link to On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs (Q1944116):
Displaying 7 items.
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
- Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) (← links)
- Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)
- Exact algorithm for graph homomorphism and locally injective graph homomorphism (Q2446599) (← links)
- Determining the \(L(2,1)\)-span in polynomial space (Q2446848) (← links)
- (Q3381615) (← links)
- Computing L(p,1)-Labeling with Combined Parameters (Q5049996) (← links)