Spremljaj
Trung Duy Doan
Trung Duy Doan
Preverjeni e-poštni naslov na hust.edu.vn
Naslov
Navedeno
Navedeno
Leto
Graphs with conflict-free connection number two
H Chang, TD Doan, Z Huang, S Jendrol’, X Li, I Schiermeyer
Graphs and Combinatorics 34, 1553-1563, 2018
172018
Minimum degree conditions for the proper connection number of graphs
C Brause, TD Doan, I Schiermeyer
Graphs and Combinatorics 33 (4), 833-843, 2017
172017
On the minimum degree and the proper connection number of graphs
C Brause, TD Doan, I Schiermeyer
Electronic Notes in Discrete Mathematics 55, 109-112, 2016
82016
On the chromatic number of (P5, K2, t)-free graphs
C Brause, TD Doan, I Schiermeyer
Electronic Notes in Discrete Mathematics 55, 127-130, 2016
72016
Conflict-free vertex connection number at most 3 and size of graphs
TD Doan, I Schiermeyer
Discussiones Mathematicae Graph Theory 41 (2), 617–632, 2021
62021
Proper connection number 2, connectivity, and forbidden subgraphs
C Brause, TD Doan, I Schiermeyer
Electronic Notes in Discrete Mathematics 55, 105-108, 2016
52016
Conflict-free connection number and size of graphs
TD Doan, I Schiermeyer
Graphs and Combinatorics 37 (5), 1859-1871, 2021
42021
Proper rainbow connection number of graphs
TD Doan, I Schiermeyer
Discussiones MathematicaeGraph Theory 41 (3), 809–826, 2021
42021
The Conflict-Free Vertex-Connection Number and Degree Conditions of Graphs
TD Doan, PH Ha, I Schiermeyer
Graphs and Combinatorics 38 (5), 157, 2022
22022
(1, 2)-rainbow connection number at most 3 in connected dense graphs
TD Doan
Electronic Journal of Graph Theory and Applications (EJGTA) 11 (2), 411-417, 2023
2023
The proper 2-connection number and size of graphs
TD Doan, I Schiermeyer
Discrete Applied Mathematics 320, 296-303, 2022
2022
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4
C Brause, TD Doan, P Holub, A Kabela, Z Ryjáček, I Schiermeyer, ...
Discrete Mathematics 345 (6), 112837, 2022
2022
Proper connection number of graphs
TD Doan
2018
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–13