Pages that link to "Item:Q3525597"
From MaRDI portal
The following pages link to Exact Algorithms for L(2,1)-Labeling of Graphs (Q3525597):
Displaying 9 items.
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
- Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) (← links)
- Frequency assignment problem in networks with limited spectrum (Q1788938) (← links)
- Modeling the packing coloring problem of graphs (Q2009921) (← links)
- A linear time algorithm for \(L(2,1)\)-labeling of trees (Q2375957) (← links)
- \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles (Q2668538) (← links)
- Fast Exact Algorithm for L(2,1)-Labeling of Graphs (Q3010388) (← links)
- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds (Q3057611) (← links)
- \(L(2,1)\)-labeling for brick product graphs (Q5963632) (← links)
