Trung Duy Doan

Discret. Appl. Math., 2024

Graphs with large (1,2)-rainbow connection numbers.

[BibT_eX]

[DOI]

Thi Thanh Chau Do

Appl. Math. Comput., 2024

The conflict-free connection number and the minimum degree-sum of graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2024

2023

(1, 2)-rainbow connection number at most 3 in connected dense graphs.

[BibT_eX]

[DOI]

Le Thi Duyen

Electron. J. Graph Theory Appl., 2023

2022

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

[BibT_eX]

[DOI]

Pham Hoang Ha

Graphs Comb., 2022

Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4.

[BibT_eX]

[DOI]

Discret. Math., 2022

The proper 2-connection number and size of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

Conflict-Free Connection Number and Size of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2021

Proper rainbow connection number of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2021

Conflict-free vertex connection number at most 3 and size of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2021

2018

Graphs with Conflict-Free Connection Number Two.

[BibT_eX]

[DOI]

Graphs Comb., 2018

2017

Minimum Degree Conditions for the Proper Connection Number of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2017

2016

On the chromatic number of (P<sub>5</sub>, K<sub>2, t</sub>)-free graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

On the minimum degree and the proper connection number of graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

Proper connection number 2, connectivity, and forbidden subgraphs.

[BibT_eX]

[DOI]