default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTrung Duy Doan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Trung Duy Doan, Thi Thanh Chau Do
, Ingo Schiermeyer:
Graphs with large (1,2)-rainbow connection numbers. Appl. Math. Comput. 479: 128886 (2024)- [j14]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) - [j13]Christoph Brause, Trung Duy Doan, Ingo Schiermeyer:
The proper 2-connection number of several graph classes. Discret. Appl. Math. 359: 34-44 (2024) - 2023
- [j12]Trung Duy Doan, Le Thi Duyen:
(1, 2)-rainbow connection number at most 3 in connected dense graphs. Electron. J. Graph Theory Appl. 11(2): 411-417 (2023) - 2022
- [j11]Trung Duy Doan, Ingo Schiermeyer:
The proper 2-connection number and size of graphs. Discret. Appl. Math. 320: 296-303 (2022) - [j10]Christoph Brause, Trung Duy Doan, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána:
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4. Discret. Math. 345(6): 112837 (2022) - [j9]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
- [j8]Trung Duy Doan, Ingo Schiermeyer:
Conflict-free vertex connection number at most 3 and size of graphs. Discuss. Math. Graph Theory 41(2): 617-632 (2021) - [j7]Trung Duy Doan, Ingo Schiermeyer:
Proper rainbow connection number of graphs. Discuss. Math. Graph Theory 41(3): 809-826 (2021) - [j6]Trung Duy Doan, Ingo Schiermeyer:
Conflict-Free Connection Number and Size of Graphs. Graphs Comb. 37(5): 1859-1871 (2021)
2010 – 2019
- 2018
- [j5]Hong Chang, Trung Duy Doan, Zhong Huang, Stanislav Jendrol', Xueliang Li, Ingo Schiermeyer:
Graphs with Conflict-Free Connection Number Two. Graphs Comb. 34(6): 1553-1563 (2018) - 2017
- [j4]Christoph Brause, Trung Duy Doan, Ingo Schiermeyer:
Minimum Degree Conditions for the Proper Connection Number of Graphs. Graphs Comb. 33(4): 833-843 (2017) - 2016
- [j3]Christoph Brause, Trung Duy Doan, Ingo Schiermeyer:
Proper connection number 2, connectivity, and forbidden subgraphs. Electron. Notes Discret. Math. 55: 105-108 (2016) - [j2]Christoph Brause, Trung Duy Doan, Ingo Schiermeyer:
On the minimum degree and the proper connection number of graphs. Electron. Notes Discret. Math. 55: 109-112 (2016) - [j1]Christoph Brause, Trung Duy Doan, Ingo Schiermeyer:
On the chromatic number of (P5, K2, t)-free graphs. Electron. Notes Discret. Math. 55: 127-130 (2016)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 21:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
