default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNgo Dac Tan
Person information
- affiliation: Vietnamese Academy of Science and Technology, Institute of Mathematics, Hanoi, Vietnam
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j23]Ngo Dac Tan
:
A decomposition for digraphs with minimum outdegree 3 having no vertex disjoint cycles of different lengths. Discuss. Math. Graph Theory 43(2): 573-581 (2023)- [j22]Le Xuan Hung, Ngo Dac Tan:
Vertex-Disjoint Cycles of Different Lengths in Local Tournaments. Graphs Comb. 39(4): 92 (2023) - 2022
- [j21]Le Xuan Hung, Duy Hieu Do, Ngo Dac Tan:
Vertex-disjoint cycles of different lengths in multipartite tournaments. Discret. Math. 345(6): 112819 (2022) - 2021
- [j20]Ngo Dac Tan:
Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths. SIAM J. Discret. Math. 35(1): 485-494 (2021) - 2020
- [j19]Ngo Dac Tan:
On 3-regular digraphs of girth 4. Discret. Math. 343(1): 111632 (2020)
2010 – 2019
- 2017
- [j18]Ngo Dac Tan:
On 3-regular digraphs without vertex disjoint cycles of different lengths. Discret. Math. 340(8): 1933-1943 (2017) - 2015
- [j17]Ngo Dac Tan:
On vertex disjoint cycles of different lengths in 3-regular digraphs. Discret. Math. 338(12): 2485-2491 (2015) - 2014
- [j16]Ngo Dac Tan:
On d-arc-dominated Oriented Graphs. Graphs Comb. 30(4): 1045-1054 (2014) - [j15]Ngo Dac Tan:
Vertex disjoint cycles of different lengths in d-arc-dominated digraphs. Oper. Res. Lett. 42(5): 351-354 (2014) - 2010
- [j14]Ngo Dac Tan:
3-Arc-Dominated Digraphs. SIAM J. Discret. Math. 24(3): 1153-1161 (2010)
2000 – 2009
- 2008
- [j13]Ngo Dac Tan:
On a problem of Froncek and Kubesa. Australas. J Comb. 40: 237-246 (2008) - [j12]Chawalit Iamjaroen, Ngo Dac Tan:
A classfication for maximal nonhamiltonian Burkard-Hammer graphs. Discuss. Math. Graph Theory 28(1): 67-89 (2008) - 2005
- [j11]Ngo Dac Tan, Tran Minh Tuoc:
An algorithm for determining connectedness of tetravalent metacirculant graphs. Australas. J Comb. 32: 259-278 (2005) - [j10]Ngo Dac Tan, Le Xuan Hung:
On the Burkard-Hammer condition for hamiltonian split graphs. Discret. Math. 296(1): 59-72 (2005) - 2004
- [j9]Le Xuan Hung, Ngo Dac Tan:
Hamilton cycles in split graphs with large minimum degree. Discuss. Math. Graph Theory 24(1): 23-40 (2004) - 2003
- [j8]Ngo Dac Tan:
The Automorphism Groups of Certain Tetravalent Metacirculant Graphs. Ars Comb. 66 (2003) - [c1]Ngo Dac Tan, Chawalit Iamjaroen:
Constructions for Nonhamiltonian Burkard-Hammer Graphs. IJCCGGT 2003: 185-199 - 2002
- [j7]Ngo Dac Tan:
On Non-Cayley Tetravalent Metacirculant Graphs. Graphs Comb. 18(4): 795-802 (2002)
1990 – 1999
- 1996
- [j6]Ngo Dac Tan:
On Hamilton cycles in cubic (m, n)-metacirculant graphs, II. Australas. J Comb. 14: 235-258 (1996) - [j5]Ngo Dac Tan:
On the isomorphism problem for a family of cubic metacirculant graphs. Discret. Math. 151(1-3): 231-242 (1996) - [j4]Ngo Dac Tan:
Cubic (m, n)-metacirculant graphs which are not Cayley graphs. Discret. Math. 154(1-3): 237-244 (1996) - [j3]Ngo Dac Tan:
Non-Cayley tetravalent metacirculant graphs and their Hamiltonicity. J. Graph Theory 23(3): 273-287 (1996) - 1994
- [j2]Ngo Dac Tan:
Hamilton cycles in cubic (m, n)-metacirculant graphs withm divisible by 4. Graphs Comb. 10(1): 67-73 (1994) - 1993
- [j1]Ngo Dac Tan:
On Hamilton cycles in cubic (m, n)-metacirculant graphs. Australas. J Comb. 8: 211-232 (1993)
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-04-24 23:02 CEST 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:
