Existence of Resolvable Path Designs. - Jean-Claude Bermond; Katherine Heinrich; Min-Li Yu (Eur. J. Comb., 1990)

On Resolvable Mixed Path Designs. - Jean-Claude Bermond; Katherine Heinrich; Min-Li Yu (Eur. J. Comb., 1990)

Almost resolvable Pk-decompositions of complete graphs. - Min-Li Yu (J. Graph Theory, 1991)

Resolvable Tree Designs. - Min-Li Yu (J. Comb. Theory A, 1992)

On induced matchings. - Angelika Steger; Min-Li Yu (Discret. Math., 1993)

On path factorizations of complete multipartite graphs. - Min-Li Yu (Discret. Math., 1993)

On tree factorizations of Kn. - Min-Li Yu (J. Graph Theory, 1993)

Generalized Partitions of Graphs. - Gary MacGilivray; Min-Li Yu (Discret. Appl. Math., 1999)

P4-decompositions of regular graphs. - Katherine Heinrich; Jiping Liu; Min-Li Yu (J. Graph Theory, 1999)

Improved Bounds for Gossiping in Mesh Bus Networks. - Jean-Claude Bermond; Susan Marshall; Min-Li Yu (J. Interconnect. Networks, 2000)

On Hamilton cycle decompositions of the tensor product of complete graphs. - R. Balakrishnan; Jean-Claude Bermond; P. Paulraja; Min-Li Yu (Discret. Math., 2003)

Grooming in unidirectional rings: K4-e designs. - Jean-Claude Bermond; Charles J. Colbourn; Alan C. H. Ling; Min-Li Yu (Discret. Math., 2004)

Gathering Algorithms on Paths Under Interference Constraints. - Jean-Claude Bermond; Ricardo C. Corrêa; Min-Li Yu (CIAC, 2006)

Vertex disjoint routings of cycles over tori. - Jean-Claude Bermond; Min-Li Yu (Networks, 2007)

Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences. - Jean-Claude Bermond; Min-Li Yu (ADHOC-NOW, 2008)

(p, 1)-Total labelling of graphs. - Frédéric Havet; Min-Li Yu (Discret. Math., 2008)

Optimal gathering protocols on paths under interference constraints. - Jean-Claude Bermond; Ricardo C. Corrêa; Min-Li Yu (Discret. Math., 2009)

Optimal Gathering Algorithms in Multi-Hop Radio Tree-Networks with Interferences. - Jean-Claude Bermond; Min-Li Yu (Ad Hoc Sens. Wirel. Networks, 2010)

Corrigendum to "(p, 1)-total labelling of graphs" [Discrete Mathematics 308 (2008) 496-513]. - Frédéric Havet; Min-Li Yu (Discret. Math., 2010)

Complexity of greedy edge-colouring. - Frédéric Havet; Ana Karolinna Maia; Min-Li Yu (J. Braz. Comput. Soc., 2015)

Data gathering and personalized broadcasting in radio grids with interference. - Jean-Claude Bermond; Bi Li 004; Nicolas Nisse; Hervé Rivano; Min-Li Yu (Theor. Comput. Sci., 2015)