![]() | ![]() |
H. L. Fu
List of publications from the DBLP Bibliography Server - FAQ
2009 | ||
---|---|---|
56 | EE | F. H. Chang, Hung-Lin Fu, Frank K. Hwang, B. C. Lin: The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks. Discrete Applied Mathematics 157(1): 164-169 (2009) |
2008 | ||
55 | EE | Hung-Lin Fu, S. L. Logan, Christopher A. Rodger: Maximal sets of hamilton cycles in K2p-F. Discrete Mathematics 308(13): 2822-2829 (2008) |
54 | EE | Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger, Todd Smith: All graphs with maximum degree three whose complements have 4-cycle decompositions. Discrete Mathematics 308(13): 2901-2909 (2008) |
53 | EE | Liqun Pu, Hung-Lin Fu, Hao Shen: Maximal sets of Hamilton cycles in Dn. Discrete Mathematics 308(16): 3706-3710 (2008) |
52 | EE | Hung-Lin Fu, Kuo-Ching Huang, Chih-Hung Yen: The linear 3-arboricity of Kn, n and Kn. Discrete Mathematics 308(17): 3816-3823 (2008) |
51 | EE | Chia-Fen Chang, Bor-Liang Chen, Hung-Lin Fu: Near automorphisms of cycles. Discrete Mathematics 308(7): 1088-1092 (2008) |
50 | EE | Hung-Lin Fu, Frank K. Hwang: A new construction of I-separable matrices via an improved decoding of Macula's construction. Discrete Optimization 5(4): 700-704 (2008) |
49 | EE | David Cariolaro, Hung-Lin Fu: On minimum sets of 1-factors covering a complete multipartite graph. Journal of Graph Theory 58(3): 239-250 (2008) |
48 | EE | Jyhmin Kuo, Hung-Lin Fu: On the diameter of the generalized undirected de Bruijn graphs UGB(n, m), n2 < m <= n3. Networks 52(4): 180-182 (2008) |
47 | EE | Hong-Bin Chen, Hung-Lin Fu, Frank K. Hwang: An upper bound of the number of tests in pooling designs for the error-tolerant complex model. Optimization Letters 2(3): 425-431 (2008) |
2007 | ||
46 | EE | Gerard J. Chang, Hung-Lin Fu, Xuding Zhu: Editorial note. J. Comb. Optim. 14(2-3): 111-112 (2007) |
45 | EE | Jyhmin Kuo, Hung-Lin Fu: Wide diameters of de Bruijn graphs. J. Comb. Optim. 14(2-3): 143-152 (2007) |
44 | EE | Chia-Fen Chang, Hung-Lin Fu: Near automorphisms of trees with small total relative displacements. J. Comb. Optim. 14(2-3): 191-195 (2007) |
43 | EE | Ming-Hway Huang, Chin-Mei Fu, Hung-Lin Fu: Packing 5-cycles into balanced complete m -partite graphs for odd m. J. Comb. Optim. 14(2-3): 323-329 (2007) |
42 | EE | Shung-Liang Wu, Hung-Lin Fu: Maximum cyclic 4-cycle packings of the complete multipartite graph. J. Comb. Optim. 14(2-3): 365-382 (2007) |
2006 | ||
41 | EE | Hung-Lin Fu, Frank K. Hwang: A novel use of t-packings to construct d-disjunct matrices. Discrete Applied Mathematics 154(12): 1759-1762 (2006) |
40 | EE | Chin-Lin Shiue, Hung-Lin Fu: alpha-labeling number of trees. Discrete Mathematics 306(24): 3290-3296 (2006) |
39 | EE | Shung-Liang Wu, Hung-Lin Fu: A Note on Cyclic m-cycle Systems of Kr(m). Graphs and Combinatorics 22(3): 427-432 (2006) |
38 | EE | S. Akbari, A. Alipour, H. L. Fu, Y. H. Lo: Multicolored Parallelisms of Isomorphic Spanning Trees. SIAM J. Discrete Math. 20(3): 564-567 (2006) |
2005 | ||
37 | David James Ashe, Christopher A. Rodger, Hung-Lin Fu: All 2-Regular Leaves of Partial 6-cycle Systems. Ars Comb. 76: (2005) | |
36 | EE | Elizabeth J. Billington, Hung-Lin Fu, Christopher A. Rodger: Packing lambda-Fold Complete Multipartite Graphs with 4-Cycles. Graphs and Combinatorics 21(2): 169-186 (2005) |
35 | EE | Hung-Lin Fu, Frank K. Hwang: On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls. J. Comb. Optim. 9(3): 263-266 (2005) |
2004 | ||
34 | EE | Ming-Chun Tsai, Hung-Lin Fu: Edge Number of 3-Connected Diameter 3 Graphs. ISPAN 2004: 364-367 |
33 | Hung-Lin Fu, Ming-Hway Huang: Packing Balanced Complete Multipartite Graph with Hexagons. Ars Comb. 71: (2004) | |
32 | Hui-Lan Fan, Hung-Lin Fu: The Edge-Coloring of Graphs with Small Genus. Ars Comb. 73: (2004) | |
31 | EE | David James Ashe, Hung-Lin Fu, Christopher A. Rodger: A solution to the forest leave problem for partial 6-cycle systems. Discrete Mathematics 281(1-3): 27-41 (2004) |
30 | EE | Hung-Lin Fu, Shung-Liang Wu: Cyclically decomposing the complete graph into cycles. Discrete Mathematics 282(1-3): 267-273 (2004) |
29 | EE | Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger: Decomposing KncupP into triangles. Discrete Mathematics 284(1-3): 131-136 (2004) |
28 | EE | Renwang Su, Hung-Lin Fu, Hao Shen: Embeddings of maximum packings in triple systems. Discrete Mathematics 284(1-3): 235-245 (2004) |
2003 | ||
27 | EE | Yukiyasu Mutoh, Toshio Morihara, Masakazu Jimbo, Hung-Lin Fu: The Existence of 2x4 Grid-Block Designs and Their Applications. SIAM J. Discrete Math. 16(2): 173-178 (2003) |
2002 | ||
26 | Yen-Chi Chen, Hung-Lin Fu, I-Fan Sun: A Study of Typenumber in Book-Embedding. Ars Comb. 62: (2002) | |
25 | EE | Hung-Lin Fu, Wei-Hsin Hu: Ascending subgraph decompositions of regular graphs. Discrete Mathematics 253(1-3): 11-18 (2002) |
24 | EE | Hung-Lin Fu, I-Fan Sun: The typenumber of trees. Discrete Mathematics 253(1-3): 3-10 (2002) |
23 | EE | Darryn E. Bryant, Hung-Lin Fu: C4-saturated bipartite graphs. Discrete Mathematics 259(1-3): 263-268 (2002) |
22 | EE | Hung-Lin Fu, Ming-Chun Tsai: The Maximum Genus of a Graph with Given Diameter and Connectivity. Electronic Notes in Discrete Mathematics 11: 322-329 (2002) |
21 | EE | Hung-Lin Fu, Ming-Chun Tsai: The Maximum Genus of a Graph with Given Diameter and Connectivity. Electronic Notes in Discrete Mathematics 11: 330-337 (2002) |
2001 | ||
20 | EE | Hung-Lin Fu, Ming-Chun Tsai, N. H. Xuong: The decay number and the maximum genus of diameter 2 graphs. Discrete Mathematics 226(1-3): 191-197 (2001) |
19 | EE | Hung-Lin Fu, Wei-Hsin Hu: A note on ascending subgraph decompositions of complete multipartite graphs. Discrete Mathematics 226(1-3): 397-402 (2001) |
18 | H. L. Fu, Christopher A. Rodger: Four-Cycle Systems with Two-Regular Leaves. Graphs and Combinatorics 17(3): 457-461 (2001) | |
2000 | ||
17 | Hung-Lin Fu, I-Fan Sun: A Study of the Genus of a Group. Ars Comb. 55: (2000) | |
16 | Gerard J. Chang, Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang: Linear k-arboricities on trees. Discrete Applied Mathematics 103(1-3): 281-287 (2000) | |
15 | EE | Saad El-Zanati, Hung-Lin Fu, Chin-Lin Shiue: On the alpha-labeling number of bipartite graphs. Discrete Mathematics 214(1-3): 241-243 (2000) |
14 | EE | Hung-Lin Fu, Chin-Lin Shiue: The optimal pebbling number of the complete m-ary tree. Discrete Mathematics 222(1-3): 89-100 (2000) |
1999 | ||
13 | Hung-Lin Fu, Christopher A. Rodger: Almost Resolvable Directed m-cycle systems: m = 3 (mod 6). Ars Comb. 53: (1999) | |
12 | Hung-Lin Fu, Christopher A. Rodger, Dinesh G. Sarvate: The existence of group divisible designs with first and second associates, having block size 3. Ars Comb. 54: (1999) | |
1998 | ||
11 | EE | H. L. Fu, Charles C. Lindner, C. A. Rodger: Two Doyen-Wilson theorems for maximum packings with triples. Discrete Mathematics 178(1-3): 63-71 (1998) |
10 | EE | H. L. Fu, Charles C. Lindner: The Doyen-Wilson theorem for maximum packings of Kn with 4-cycles. Discrete Mathematics 183(1-3): 103-117 (1998) |
9 | EE | Bor-Liang Chen, Chun-Kan Cheng, Hung-Lin Fu, Kuo-Ching Huang: A study of the total chromatic number of equibipartite graphs. Discrete Mathematics 184(1-3): 49-60 (1998) |
8 | EE | Hung-Lin Fu, Christopher A. Rodger: Group Divisible Designs with Two Associate Classes: n=2 orm=2. J. Comb. Theory, Ser. A 83(1): 94-117 (1998) |
1997 | ||
7 | EE | Nam-Po Chiang, Hung-Lin Fu: On upper bounds for the pseudo-achromatic index. Discrete Mathematics 175(1-3): 79-86 (1997) |
1995 | ||
6 | EE | Nam-Po Chiang, Hung-Lin Fu: The achromatic indices of the regular complete multipartite graphs. Discrete Mathematics 141(1-3): 61-66 (1995) |
1994 | ||
5 | EE | Hung-Lin Fu, Kuo-Ching Huang: On prime labellings. Discrete Mathematics 127(1-3): 181-186 (1994) |
4 | EE | Hung-Lin Fu, Wei-Hsin Hu: Disjoint odd integer subsets having a constant odd sum. Discrete Mathematics 128(1-3): 143-150 (1994) |
3 | EE | Bor-Liang Chen, Hung-Lin Fu: Edge domination in complete partite graphs. Discrete Mathematics 132(1-3): 29-35 (1994) |
1990 | ||
2 | EE | Hung-Lin Fu: A note on the ascending subgraph decomposition problem. Discrete Mathematics 84(3): 315-318 (1990) |
1987 | ||
1 | EE | Hung-Lin Fu: Intersection problem of Steiner systems S(3, 4, 2nu). Discrete Mathematics 67(3): 241-247 (1987) |