# Professor Hung-Lin Fu

##### Contact

- Email: hlfu@math.nctu.edu.tw
- Tel: +886-3-573-1623
- Fax: +886-3-573-1623 or +886-3-572-4679
- Address:

##### Teaching

- Fall Semester, 2023：
- Graph Theory

- Spring Semester, 2023：
- Computational Molecular Biology

##### Vitae

- Education
- B.S. in Mathematics, National Taiwan Normal University.
- M.S. in Mathematics, Auburn University, Alabama, U.S.A.
- Ph.D. in Mathematics, Auburn University, Alabama, U.S.A.

- Research Areas
- Graph Theory
- Combinatorial Design
- Combinatoria Theory and its Applications

- Positions, Honors and Awards
- Lecturer, Mathematics, Auburn University in U.S.(09/1980 - 06/1981)
- Associate Professor, Mathematics, Tamkang University.( 08/1981 - 07/1984)
- Associate Professor, Department of Applied Mathematics, Auburn University in U.S. (08/1984- 07/1987)
- Associate Professor, Department of Applied Mathematics, National Chiao-Tung University.( 08/1987 - 07/1988)
- Professor, Department of Applied Mathematics, National Chiao-Tung University.( 08/1988 - )
- Fellow, Institute of Combinctorics with its Applications(ICA). Archery Coach of National Team

- Recent Research Projects
- Group Testing and Its Applications(III) (105-2115-M-009-013-)
- Group Testing and Its Applications(II) (104-2115-M-009-009-)
- Group Testing and Its Applications(I) (103-2115-M-009-013-)
- Combinatorics and Discrete Models (100-2115-M-009-005-MY3)
- Applications of Combinatorics in Computational Molecular Biology (97-2115-M-009-011-MY3)
- A Study of Graph-Designs(3/3)( NSC 96-2115-M-009-003-)
- A Study of Graph-Designs(2/3)( NSC 95-2115-M-009-008-)
- A Study of Graph-Designs(1/3)(NSC 94-2115-M-009-017-)
- Applied Combinatorics(3/3) (NSC93-2115-M-009-002- )
- Applied Combinatorics(2/3) (NSC 92-2115-M-009-004- )
- Applied Combinatorics(1/3) (NSC 91-2115-M-009-011- )

##### Selected Publications

(A) Refereed Papers：

1. Directed triple system having a prescribed number of triples in common, Tamkang J. of Math., Vol. 14, No. 1, 1983, 85-90.

2. A heterogeneous quadruple system of order 14×2^{n}, Tamkang J. of Math., Vol. 15, No. 1, 1984, 103-114.

3. On the constructions and applications of two 1-factorizations with prescribed intersections, Tamkang J. of Math., Vol. 16, No. 3, 1985, 117-124.

4. On latin (n×n×(n-2))-parallelepipeds, Tamkang J. of Math., Vol. 17, No. 1, 1986, 107-111.

5. On the bipartite orthogonal latin square graph, Congressus Numerantium, Vol. 54, 1986, 169-172.

6. Steiner quadruple systems of order 4v with prescribed intersections, Ars Combinatoria, Vol. 21, 1986, 89-103.

7. Steiner quadruple systems with a spanning block design, Congressus Numerantium, Vol. 60, 1987, 145-150.

8. A note on the block intersection problem of Steiner quadruple systems of order u×v, Tamkang J. of Math., Vol. 18, No. 2, 1987, 59-63.

9. Intersection problem of Steiner systems S(3,4,2v), Discrete Math., Vol. 67, No. 3, 1987, 241-247.

10. On latin cubes with prescribed intersections,Ars Combinatoria, Vol. 23, 1987, 171-176.

11. Some results on ascending subgraph decomposition, Bulletin of the Institute of Mathematics, Academia Sinica, Vol. 16, No. 4, 1988, 341-345.

12. More results on the orthogonal latin square graphs, Ars Combinatoria, 27(1989), 143-148.

13. The intersections of three distinct latin squares (with Chin-Mei Fu), LE MATHEMATICHE, Vol. XLIV 1989-Fasc. I, 21-46.

14. Partition a graph into ascending subgraphs (with Wei-Hsin Hu), Utilitas Mathematica, 36(1989), 97-105.

15. The mutual intersection of three distinct 1-factorizations (with Chin-Mei Fu),Ars Combinatoria, Vol. 28, 1989, 55-64.

16. On the intersections of latin squares with holes (with Chin-Mei Fu), Utilitas Mathematica, 35(1989), 67-74.

17. On the existence of whim domino squares (with Chin-Lin Shiue), J. of Combin. Math. and Comb. Comp., 7, 1990, 171-175.

18. More results on the intersections of latin squares, J. of Information and Optimization Sciences, Vol. 11, No. 3, 1990, 525-535.

24. A note on the ascending subgraph decomposition, Discrete Math., 84(1990), 315-318.

34. On prime labelings (with Kuo-Ching Huang), Discrete Math., 127(1994), 181-186.

38. Some results on equalized total coloring, Congressus Numerantium, 102(1994), 111-119.

62. Forestleaves and four-cycles (with C. A. Rodger), J. Graph Theory, Vol. 33, 2000, 161-166.

64. A study of the genus of a group (with I-Fan Sun), Ars Combinatoria, 55(2000), 181-191.

78. The typenumber of trees (with I. F. Sun), Discrete Math**.**, 253(2002), 3-10.

80. C_{4}-saturated bipartite graphs (with D. E. Bryant),Discrete Math. 259(2002), 263-268.

96. Balanced bipartite 4-cycle designs, Australasian J. of Combin., 32(2005), 3-26.

104. α-labelling number of trees (with C. L. Shiue), Discrete Math**.**, 306(2006), 3290-3296.

111. New results on harmonious trees (with Hui-Chuan Lu), Utilitas Math., 74(2007), 97-110.

123.On the diameter of the generalized undirected de Bruijn graphs UG_{B}(n,m), n^{2}^{3}(with Jyhmin Kuo), Networks, Vol. 52, Issue 4, 2008, 180-182.

128. Excessive near 1-factorizations (with D. Cariolaro), Discrete Math., 309(2009), 4690-4696.

135. Some results on 4-cycle packings, Ars Combin. 93, 2009, 15-23.

142. Sparseness of 4-cycle systems (with Y. Fujiwara and Shung-Liang Wu), JCMCC 75(2010), 175 – 185.

144. Embeddings of maximum packings of triples (with Renwang Su), Ars Combin., 98 (2011), 337 – 351.

172. Packing graphs with graph of size three (with Zhen-Chun Chen and Kuo-Ching Huang), to appear Taiwanese J.Math.

175. Mid-labeled partial digest problem (with Kuo-Ching Huang and Yi-Ting Hsiao), in preprints.

177. Optimal equi-difference conflict-avoiding codes of prime length and weight 4, in preprints.

180. Linear 3-arboricity of K_{m(n)} (with Chi-Hung Yen), JCMCC 60(2007), 33 – 46.

182. Rumor source detection in unicyclic graphs (with Pei-Duo Yu and Chee Wei Tan), in preprints.

go back