Ngo Dac Tan
Full Professor, Doctor

Cộng tác viên
Research interests: Vertex-transitive graphs, structure of graphs, digraphs


Address
Office: Building A6, Room 511
Tel: +84 (0)24 38361121/511
Email: ndtan AT math.ac.vn

Born in Bac Ninh


Education and academic degrees:

  • 1975: Bachelor, Belarussian State University, Minsk, Belarus
  • 1986: PhD, Belarussian State University, Minsk, Belarus
  • 2002: Associate Professor
  • 2006: Full Professor


Positions:

  • 1996 – 2002: Head of Department
  • 2007 -2012: Deputy Director


Research areas: Discrete Mathematics

 

PUBLICATIONS

List of publications in MathSciNet

 

List of recent publications
1Le Xuan Hung, Ngo Dac Tan, Vertex-disjoint cycles of different lengths in local tournaments, Graphs and Combinatorics, Volume 39, Issue 5, Article number 92 (2023) (SCI-E, Scopus)
2Ngo Dac Tan, Decomposition for digraphs with minimum outdegree 3 having no vertex disjoint cycles of different lengths, Discussiones Mathematicae Graph Theory, Vol. 43, No 2 (2023), 573 - 581, (SCI-E, Scopus).
3Le Xuan Hung, Do Duy Hieu, Ngo Dac Tan, Vertex-disjoint cycles of different lengths in multipartite tournaments, Discrete Mathematics, 345, Issue 6 (2022), Article 112819, (SCI-E, Scopus).
4Ngo Dac Tan, Tournaments and bipartite tournaments without vertex disjoint cycles of different lengths, SIAM Journal on Discrete Mathematics, 35 (1) (2021), 485 - 494, (SCI-E, Scopus).
5Ngo Dac Tan, On 3-regular digraphs of girth 4, Discrete Mathematics, 343 (2020), Article 111632,SCI(-E), Scopus.
6Ngo Dac Tan, On 3-regular digraphs without vertex disjoint cycles of different lengths, Discrete Mathematics 340 (2017) 1933 - 1943, SCI(-E); Scopus.
7Ngo Dac Tan, On vertex disjoint cycles of different lengths in 3-regular digraphs, Discrete Mathematics 338 (2015), 2485 - 2491, SCI(-E), Scopus.
8Ngo Dac Tan, Vertex disjoint cycles of different lengths in d-arc-dominated digraphs, Operations Research Letters, 42 (2014), 351 - 354,SCI(-E), Scopus.
9Ngo Dac Tan, On d-arc-dominated oriented graphs, Graphs and Combinatorics, 30, (2014), 1045 - 1054, SCI(-E); Scopus.
10Ngo Dac Tan, The completion of a classification for maximal nonhamiltonian Burkard-Hammer graphs, Vietnam Journal of Mathematics 41 (2013), 465 - 505, Scopus.
11Ngo Dac Tan, 3-arc-dominated digraphs, SIAM Journal on Discrete Mathematics, 24 (2010), 1153 - 1161, SCI(-E); Scopus.
12Ngo Dac Tan, On the hamiltonian and classification problems for some families of split graphs, Vietnam J. Math., 37 (2009), 379-386.
13Ngo Dac Tan, Ch. Iamjaroen, A classification for maximal nonhamiltonian Burkard-Hammer graphs, Discuss. Math. Graph Theory 28 (2008), 67 - 89.
14Ngo Dac Tan, On a problem of Froncek and Kubesa,  Australas. J. Combin. 40 (2008), 237 - 245.
15Ngo Dac Tan, Le Xuan Hung, On colorings of split graphs, Acta Math. Vietnamica 31 (2006) 195 -204.
16Ngo Dac Tan, A note on maximal nonhamiltonian Burkard-Hammer graphs, Vietnam J. Math. 34 (2006), 397 - 409.
17Ngo Dac Tan, Ch. Iamjaroen, A necessary condition for maximal nonhamiltonian Burkard-Hammer graphs, J. Discrete Math. Sci. Cryptogr. 9 (2006), 235 - 252.
18Ngo Dac Tan, On the classification problem for tetravalent metacirculant graphs, J. Discrete Math. Sci. Cryptogr. 8 (2005), N0 3, 403 - 412.
19Ngo Dac Tan, Tran Minh Tuoc, Connectedness of tetravalent metacirculant graphs with non-empty first symbol, In: The Mathematical Foundation of Informatics (Proceedings of the Conference in Hanoi, October 25 - 28, 1999. Eds. Do Long Van and Ito M.), 183 - 193. World Scientific, Singapore 2005.
20Ngo Dac Tan, Tran Minh Tuoc, An algorithm for determining connectedness of tetravalent metacirculant graphs, Australas. J. Combin. 32 (2005), 259 - 277.
21Ngo Dac Tan, L. X. Hung, On the Burkard-Hammer condition for Hamiltonian split graphs, Discrete Math. 296 (2005), 59 - 72.
22Ngo Dac Tan, Ch. Iamjaroen, Constructions for nonhamiltonian Burkard-Hammer graphs, In: Proceedings of the Indonesia-Japan Joint Conference on Combinatorial Geometry and Graph Theory (September 13 - 16, 2003, Bandung, Indonesia), 185 - 199. Lecture Notes in Computer Science 3330, Springer, Berlin Heidelberg 2005.
23Ngo Dac Tan, Combinatorics and graph theory (in Vietnamese) – Lý thuyết tổ hợp và đồ thị. NXB ĐHQG Hanoi, 2004, 344 trang.
24Ngo Dac Tan, Le Xuan Hung, Hamilton cycles in split graphs with large minimum degree, Discussiones Math. Graph Theory 24 (2004), 23 - 40.
25Ngo Dac Tan, Tran Minh Tuoc, Hamilton cycles in connected tetravalent metacirculant graphs with non-empty first symbol, Acta Math. Vietnamica, 28, (2003) 267 - 278.
26Ngo Dac Tan, The automorphism groups of certain tetravalent metacirculant graphs. Ars Combin. 66 (2003), 205 - 232.
27Ngo Dac Tan, On non-Cayley tetravalent metacirculant graphs. Graphs Combin. 18 (2002), 795 - 802.
28Ngo Dac Tan, Classification and Hamiltonian problems for cubic and tetravalent metacirculant graphs, In: Proc. Fifth Vietnamese Math. Conf., (Hanoi, September 17 - 20, 1997, Eds. Tran Duc Van and Dinh Dung), 187 - 195. Science and Technology Publisher, Hanoi 1999.
29Ngo Dac Tan, Sufficient conditions for the existence of a Hamilton cycle in cubic (6, n)-metacirculant graphs, II. Vietnam J. Math. 26 (1998), 217 - 228.
30Ngo Dac Tan, Sufficient conditions for the existence of a Hamilton cycle in cubic (6, n)-metacirculant graphs. Vietnam J. Math. 25 (1997),  41 - 52.
31Ngo Dac Tan, On Hamilton cycles in cubic (m, n)-metacirculant graphs, II. Australas. J. Combin. 14 (1996), 235 - 257.
32Ngo Dac Tan, Non-Cayley tetravalent metacirculant graphs and their hamiltonicity. J. Graph Theory 23 (1996), 273 - 287.
33Ngo Dac Tan, Cubic (m, n)-metacirculant graphs which are not Cayley graphs. Discrete Math. 154 (1996), 237 - 244.
34Ngo Dac Tan, On the isomorphism problem for a family of cubic metacirculant graphs. Discrete Math. 151 (1996), 231 - 242.
35Ngo Dac Tan, On Hamilton cycles in cubic (10, n)-metacirculant graphs. Acta Math. Vietnam. 20 (1995), N0 2, 247 - 255.
36Ngo Dac Tan, Hamilton cycles in some vertex-transitive graphs. Southeast Asian Bull. Math. 19 (1995), 61 - 67.
37Ngo Dac Tan, A characterization of some cubic (m, n)-metacirculant graphs. Acta Math. Vietnam. 19 (1994), N0 1, 61 - 66.
38Ngo Dac Tan, Hamilton cycles in cubic (m, n)-metacirculant graphs with m divisible by 4. Graphs and Combin. 10 (1994), 67 - 73.
39Ngo Dac Tan, Connectedness of cubic metacirculant graphs. Acta Math. Vietnam. 18 (1993), 3 - 17.
40Ngo Dac Tan, On Hamilton cycles in cubic (m, n)-metacirculant graphs. Australas. J. Combin. 8 (1993), 211 - 232.
41Ngo Dac Tan, Hamilton cycles in cubic (4, n)-metacirculant graphs. Acta Math. Vietnam. 17 (1992), 83 - 93.
42Ngo Dac Tan, On cubic metacirculant graphs. Acta Math. Vietnam. 15 (1990), 57 - 71.
43Ngo Dac Tan, R. I. Tyshkevich, A generalization of Babai's lemma on Cayley graphs. Vestsi Akad. Navuk BSSR, Ser. Fiz.-Mat. Navuk 4 (1987), 29 - 32 (in Russian).
44Ngo Dac Tan, On imprimitive nilpotent irregular minimal transitive groups which are cubic graphical, In: Proc. Symp. Math. Found. Comp. Sci. and Data Security, Hanoi, July 4-6, 1986, 113 - 117 (in Vietnamese).
45Ngo Dac Tan, Trivalent graphic primitive minimal transitive permutation groups. Vestsi Akad. Navuk BSSR, Ser. Fiz.-Mat. Navuk 6 (1986), 32 - 37 (in Russian).
46Ngo Dac Tan, Minimal transitive permutation groups and related problems of graph theory. Ph. D. Thesis, Belarussian State Univ., Minsk, 1985, 134 p. (in Russian).
47Ngo Dac Tan, Nilpotent pronormal minimal transitive permutation groups. Vestsi Akad. Navuk BSSR, Ser. Fiz.-Mat. Navuk 5 (1985), 21 - 26 (in Russian).
48Ngo Dac Tan, On minimal transitive permutation groups on a countable set. Vestsi Akad. Navuk BSSR, Ser. Fiz.-Mat. Navuk 1 (1979), 12 - 18 (in Russian).
49Ngo Dac Tan, Uber abelscher Gruppen, deren voller Endomorphismenring ein EEk MI-Ring (k = 1, 2) ist. Annales Univ. Sci. Budapest. Eotvos, Sect. Math. 22/23 (1979/1980), 75 - 85.
50Ngo Dac Tan, On minimal transitive permutation groups. Vestsi Akad. Navuk BSSR, Ser. Fiz.-Mat. Navuk 6 (1976), 5 - 14 (in Russian).