iBet uBet web content aggregator. Adding the entire web to your favor.

Link to original content: https://dblp.dagstuhl.de/pid/245/3013.html

dblp: Pham Hoang Ha

default search action

combined dblp search
author search
venue search
publication search

ask others

Pham Hoang Ha

> Home > Persons

Person information

Other persons with a similar name

see FAQ

Why are some names followed by a four digit number?

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

2020 – today

see FAQ

What is the meaning of the colors in the publication lists?

2024
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/amc/DoanDHPS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amc/DoanDHPS24
Trung Duy Doan, Thi Thanh Chau Do, Pham Hoang Ha, Ngoc Diep Pham, Ingo Schiermeyer:
The conflict-free connection number and the minimum degree-sum of graphs. Appl. Math. Comput. 482: 128981 (2024)
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/pmh/HaNP24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pmh/HaNP24
Pham Hoang Ha, Le Dinh Nam, Ngoc Diep Pham:
Spanning trees of K_1,4-free graphs whose reducible stems have few leaves. Period. Math. Hung. 89(1): 61-71 (2024)
2022
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/gc/DoanHS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/DoanHS22
Trung Duy Doan, Pham Hoang Ha, Ingo Schiermeyer:
The Conflict-Free Vertex-Connection Number and Degree Conditions of Graphs. Graphs Comb. 38(5): 157 (2022)
2021
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/dam/Ha21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Ha21
Pham Hoang Ha:
A note on the independence number, connectivity and k-ended tree. Discret. Appl. Math. 305: 142-144 (2021)

2010 – 2019

see FAQ

What is the meaning of the colors in the publication lists?

2019
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/dm/ChenHH19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/ChenHH19
Yuan Chen, Pham Hoang Ha, Dang Dinh Hanh:
Spanning trees with at most 4 leaves in K1, 5-free graphs. Discret. Math. 342(8): 2342-2349 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.