Pham Hoang Ha

According to our database, Pham Hoang Ha authored at least 5 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Spanning trees of K_1,4-free graphs whose reducible stems have few leaves.

Pham Hoang Ha, Le Dinh Nam, Ngoc Diep Pham

Period. Math. Hung., September, 2024

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

2022

The Conflict-Free Vertex-Connection Number and Degree Conditions of Graphs.

Trung Duy Doan, Pham Hoang Ha, Ingo Schiermeyer

Graphs Comb., 2022

2021

A note on the independence number, connectivity and k-ended tree.

Pham Hoang Ha

Discret. Appl. Math., 2021

2019

Spanning trees with at most 4 leaves in K1, 5-free graphs.

Yuan Chen, Pham Hoang Ha, Dang Dinh Hanh

Discret. Math., 2019