We stand with Ukraine  

Ngo Dac Tan

Orcid: 0000-0002-2183-7446

Affiliations:
  • Vietnamese Academy of Science and Technology, Institute of Mathematics, Hanoi, Vietnam


According to our database1, Ngo Dac Tan authored at least 24 papers between 1993 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Vertex-Disjoint Cycles of Different Lengths in Local Tournaments.
[BibTeX]
[DOI]
Le Xuan Hung
,
Ngo Dac Tan
Graphs Comb., August, 2023

A decomposition for digraphs with minimum outdegree 3 having no vertex disjoint cycles of different lengths.
[BibTeX]
[DOI]
Ngo Dac Tan
Discuss. Math. Graph Theory, 2023

2022
Vertex-disjoint cycles of different lengths in multipartite tournaments.
[BibTeX]
[DOI]
Le Xuan Hung
,
Duy Hieu Do
,
Ngo Dac Tan
Discret. Math., 2022

2021
Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths.
[BibTeX]
[DOI]
Ngo Dac Tan
SIAM J. Discret. Math., 2021

2020
On 3-regular digraphs of girth 4.
[BibTeX]
[DOI]
Ngo Dac Tan
Discret. Math., 2020

2017
On 3-regular digraphs without vertex disjoint cycles of different lengths.
[BibTeX]
[DOI]
Ngo Dac Tan
Discret. Math., 2017

2015
On vertex disjoint cycles of different lengths in 3-regular digraphs.
[BibTeX]
[DOI]
Ngo Dac Tan
Discret. Math., 2015

2014
Vertex disjoint cycles of different lengths in d-arc-dominated digraphs.
[BibTeX]
[DOI]
Ngo Dac Tan
Oper. Res. Lett., 2014

On d-arc-dominated Oriented Graphs.
[BibTeX]
[DOI]
Ngo Dac Tan
Graphs Comb., 2014

2010
3-Arc-Dominated Digraphs.
[BibTeX]
[DOI]
Ngo Dac Tan
SIAM J. Discret. Math., 2010

2008
A classfication for maximal nonhamiltonian Burkard-Hammer graphs.
[BibTeX]
[DOI]
Chawalit Iamjaroen
,
Ngo Dac Tan
Discuss. Math. Graph Theory, 2008

On a problem of Froncek and Kubesa.
[BibTeX]
[DOI]
Ngo Dac Tan
Australas. J Comb., 2008

2005
On the Burkard-Hammer condition for hamiltonian split graphs.
[BibTeX]
[DOI]
Ngo Dac Tan
,
Le Xuan Hung
Discret. Math., 2005

An algorithm for determining connectedness of tetravalent metacirculant graphs.
[BibTeX]
[DOI]
Ngo Dac Tan
,
Tran Minh Tuoc
Australas. J Comb., 2005

2004
Hamilton cycles in split graphs with large minimum degree.
[BibTeX]
[DOI]
Le Xuan Hung
,
Ngo Dac Tan
Discuss. Math. Graph Theory, 2004

2003
The Automorphism Groups of Certain Tetravalent Metacirculant Graphs.
[BibTeX]
Ngo Dac Tan
Ars Comb., 2003

Constructions for Nonhamiltonian Burkard-Hammer Graphs.
[BibTeX]
[DOI]
Ngo Dac Tan
,
Chawalit Iamjaroen
Proceedings of the Combinatorial Geometry and Graph Theory, 2003

2002
On Non-Cayley Tetravalent Metacirculant Graphs.
[BibTeX]
[DOI]
Ngo Dac Tan
Graphs Comb., 2002

1996
Non-Cayley tetravalent metacirculant graphs and their Hamiltonicity.
[BibTeX]
[DOI]
Ngo Dac Tan
J. Graph Theory, 1996

Cubic (m, n)-metacirculant graphs which are not Cayley graphs.
[BibTeX]
[DOI]
Ngo Dac Tan
Discret. Math., 1996

On the isomorphism problem for a family of cubic metacirculant graphs.
[BibTeX]
[DOI]
Ngo Dac Tan
Discret. Math., 1996

On Hamilton cycles in cubic (m, n)-metacirculant graphs, II.
[BibTeX]
[DOI]
Ngo Dac Tan
Australas. J Comb., 1996

1994
Hamilton cycles in cubic (<i>m, n</i>)-metacirculant graphs with<i>m</i> divisible by 4.
[BibTeX]
[DOI]
Ngo Dac Tan
Graphs Comb., 1994

1993
On Hamilton cycles in cubic (m, n)-metacirculant graphs.
[BibTeX]
[DOI]
Ngo Dac Tan
Australas. J Comb., 1993


  Loading...