The conflict-free connection number and the minimum degree-sum of graphs. - Trung Duy Doan; Thi Thanh Chau Do; Pham Hoang Ha; Ngoc Diep Pham; Ingo Schiermeyer (Appl. Math. Comput., 2024)

Spanning trees of K1,4-free graphs whose reducible stems have few leaves. - Pham Hoang Ha; Le Dinh Nam; Ngoc Diep Pham (Period. Math. Hung., 2024)