The following pages link to Min-Li Yu (Q476893):
Displaying 22 items.
- Data gathering and personalized broadcasting in radio grids with interference (Q476894) (← links)
- (Q687142) (redirect page) (← links)
- On induced matchings (Q687143) (← links)
- Existence of resolvable path designs (Q923105) (← links)
- On resolvable mixed path designs (Q923106) (← links)
- Corrigendum to ``\((p,1)\)-total labelling of graphs'' [Discrete math. 308 (2008) 496-513] (Q982632) (← links)
- (Q1045040) (redirect page) (← links)
- Optimal gathering protocols on paths under interference constraints (Q1045041) (← links)
- Resolvable tree designs (Q1200005) (← links)
- Generalized partitions of graphs (Q1283792) (← links)
- On path factorizations of complete multipartite graphs (Q1313872) (← links)
- (Q1398254) (redirect page) (← links)
- On Hamilton cycle decompositions of the tensor product of complete graphs (Q1398255) (← links)
- Grooming in unidirectional rings: \(K_{4}-e\) designs (Q1876673) (← links)
- Rapid parameter identification of linear time-delay system from noisy frequency domain data (Q2183013) (← links)
- \((p,1)\)-total labelling of graphs (Q2467731) (← links)
- Gathering Algorithms on Paths Under Interference Constraints (Q3434549) (← links)
- Vertex disjoint routings of cycles over tori (Q3442864) (← links)
- Almost resolvable <i>P</i><sub><i>k</i></sub>‐decompositions of complete graphs (Q3984462) (← links)
- P4-decompositions of regular graphs (Q4248537) (← links)
- On tree factorizations of <i>K<sub>n</sub></i> (Q4285593) (← links)
- On DRC‐covering of K<sub>n</sub> by cycles (Q4800406) (← links)
