Ngô Đắc Tân

Ngô Đắc Tân

GS. TS

Chưa phân loại

Hướng nghiên cứu: Đồ thị bắc cầu đỉnh, cấu trúc của đồ thị, đồ thị có hướng

Lý lịch khoa học

Liên hệ
Email: ndtan AT math.ac.vn

Lý lịch khoa học

Nơi sinh: Bắc Ninh

  • 1975: Đại học, Đại học Quốc gia Belarus, Minsk, Belarus
  • 1986:Tiến sĩ, Đại học Quốc gia Belarus, Minsk, Belarus
  • 2002: Phó giáo sư
  • 2006: Giáo sư

Chuyên ngành: Lý thuyết đồ thị

Các vị trí công tác đã qua

  • 1996 – 2002: Trưởng phòng
  • 2007 - 2012: Phó Viện trưởng
     

Các lĩnh vực quan tâm: Toán học rời rạc

Các công bố khoa học

Ấn phẩm

  1. 1. Lê Xuân Hùng, Ngô Đắc Tân, Vertex-disjoint cycles of different lengths in local tournaments, Graphs and Combinatorics, Volume 39, Issue 5, Article number 92 (2023) (2023)
  2. 2. Ngô Đắc Tân, 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 (2023)
  3. 3. Lê Xuân Hùng, Ngô Đắc Tân, Đỗ Duy Hiếu, Vertex-disjoint cycles of different lengths in multipartite tournaments, Discrete Mathematics, 345, Issue 6 (2022), Article 112819 (2022)
  4. 4. Ngô Đắc Tân, Tournaments and bipartite tournaments without vertex disjoint cycles of different lengths, SIAM Journal on Discrete Mathematics, 35 (1) (2021), 485 - 494, (2021)
  5. 5. Ngô Đắc Tân, On 3-regular digraphs of girth 4, Discrete Mathematics, 343 (2020), Article 111632 (2020)
  6. 6. Ngô Đắc Tân, On 3-regular digraphs without vertex disjoint cycles of different lengths,, Discrete Mathematics 340 (2017) 1933 - 1943 (2017)
  7. 7. Ngô Đắc Tân, On vertex disjoint cycles of different lengths in 3-regular digraphs, Discrete Mathematics 338 (2015), 2485 - 2491 (2015)
  8. 8. Ngô Đắc Tân, Vertex disjoint cycles of different lengths in d-arc-dominated digraphs, Operations Research Letters, 42 (2014), 351 - 354 (2014)
  9. 9. Ngô Đắc Tân, On d-arc-dominated oriented graphs, Graphs and Combinatorics, 30, (2014), 1045 - 1054 (2014)
  10. 10. Ngô Đắc Tân, The completion of a classification for maximal nonhamiltonian Burkard-Hammer graphs, Vietnam Journal of Mathematics 41 (2013), 465 - 505 (2013)
  11. 11. Ngô Đắc Tân, 3-arc-dominated digraphs, SIAM Journal on Discrete Mathematics, 24 (2010), 1153 - 1161 (2010)
  12. 12. Ngô Đắc Tân, On the hamiltonian and classification problems for some families of split graphs, Vietnam J. Math., 37 (2009), 379-386. (2009)
  13. 13. Ngô Đắc Tân, Chawalit Iamjaroen, A classification for maximal nonhamiltonian Burkard-Hammer graphs, Discussiones Mathematicae Graph Theory, 28 (2008), 67 - 89. (2008)
  14. 14. Ngô Đắc Tân, On a problem of Froncek and Kubesa, The Australasian Journal of Combinatorics, 40 (2008), 237 - 245 (2008)
  15. 15. Ngô Đắc Tân, Lê Xuân Hùng, On colorings of split graphs, Acta Mathematica Vietnamica, 31 (2006) 195 -204. (2006)
  16. 16. Ngô Đắc Tân, A note on maximal nonhamiltonian Burkard-Hammer graphs, Vietnam Journal of Mathematics, 34 (2006), 397 - 409. (2006)
  17. 17. Ngô Đắc Tân, Chawalit Iamjaroen, A necessary condition for maximal nonhamiltonian Burkard-Hammer graphs, Journal of Discrete Mathematical Sciences and Cryptography, 9 (2006), 235 - 252. (2006)
  18. 18. Ngô Đắc Tân, On the classification problem for tetravalent metacirculant graphs, Journal of Discrete Mathematical Sciences and Cryptography, 8 (2005), N0 3, 403 - 412. (2005)
  19. 19. Ngô Đắc Tân, 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. (2005)
  20. 20. Ngô Đắc Tân, Tran Minh Tuoc, An algorithm for determining connectedness of tetravalent metacirculant graphs, The Australasian Journal of Combinatorics, 32 (2005), 259 - 277. (2005)
  21. 21. Ngô Đắc Tân, Lê Xuân Hùng, On the Burkard-Hammer condition for Hamiltonian split graphs, Discrete Mathematics, 296 (2005), 59 - 72. (2005)
  22. 22. Ngô Đắc Tân, Chawalit 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 (2005)
  23. 23. Ngô Đắc Tân, Combinatorics and graph theory (in Vietnamese) Lý thuyết tổ hợp và đồ thị., NXB ĐHQG Hanoi, 2004, 344 trang (2004)
  24. 24. Ngô Đắc Tân, Lê Xuân Hùng, Hamilton cycles in split graphs with large minimum degree, Discussiones Math. Graph Theory 24 (2004), 23 - 40. (2004)
  25. 25. Ngô Đắc Tân, Tran Minh Tuoc, Hamilton cycles in connected tetravalent metacirculant graphs with non-empty first symbol, Acta Mathematica Vietnamica, 28, (2003) 267 - 278. (2003)
  26. 26. Ngô Đắc Tân, The automorphism groups of certain tetravalent metacirculant graphs, Ars Combinatoria, 66 (2003), 205 - 232. (2003)
  27. 27. Ngô Đắc Tân, On non-Cayley tetravalent metacirculant graphs, Graphs Combinatorics, 18 (2002), 795 - 802. (2002)
  28. 28. Ngô Đắc Tân, 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 (1999)
  29. 29. Ngô Đắc Tân, Sufficient conditions for the existence of a Hamilton cycle in cubic $(6, n)$-metacirculant graphs, II., Vietnam J. Math. 26 (1998), 217 - 228. (1998)
  30. 30. Ngô Đắc Tân, Sufficient conditions for the existence of a Hamilton cycle in cubic (6, n)-metacirculant graphs, Vietnam J. Math. 25 (1997), 41 - 52. (1997)
  31. 31. Ngô Đắc Tân, On Hamilton cycles in cubic $(m, n)$-metacirculant graphs, II., The Australasian Journal of Combinatorics, 114 (1996), 235 - 257. (1996)
  32. 32. Ngô Đắc Tân, Non-Cayley tetravalent metacirculant graphs and their hamiltonicity, Journal of Graph Theory, 23 (1996), 273 - 287. (1996)
  33. 33. Ngô Đắc Tân, Cubic $(m, n)-$metacirculant graphs which are not Cayley graphs, Discrete Mathematics, 154 (1996), 237 - 244. (1996)
  34. 34. Ngô Đắc Tân, On the isomorphism problem for a family of cubic metacirculant graphs, Discrete Mathematics, 151 (1996), 231 - 242. (1996)
  35. 35. Ngô Đắc Tân, On Hamilton cycles in cubic $(10, n)$-metacirculant graphs, Acta Mathematica Vietnamica, 20 (1995), N0 2, 247 - 255. (1995)
  36. 36. Ngô Đắc Tân, Hamilton cycles in some vertex-transitive graphs, Southeast Asian Bull. Math. 19 (1995), 61 - 67. (1995)
  37. 37. Ngô Đắc Tân, 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 (1979)
  38. 38. Ngô Đắc Tân, On minimal transitive permutation groups on a countable set, Vestsi Akad. Navuk BSSR, Ser. Fiz.-Mat. Navuk 1 (1979), 12 - 18 (1979)
  39. 39. Ngô Đắc Tân, On minimal transitive permutation groups, Vestsi Akad. Navuk BSSR, Ser. Fiz.-Mat. Navuk 6 (1976), 5 - 14 (1976)