The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Hung-Lin Fu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ming-Chun Tsai, Hung-Lin Fu
    Edge Number of 3-Connected Diameter 3 Graphs. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2004, pp:364-367 [Conf]
  2. David James Ashe, Christopher A. Rodger, Hung-Lin Fu
    All 2-Regular Leaves of Partial 6-cycle Systems. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:76, n:, pp:- [Journal]
  3. Hung-Lin Fu, Ming-Hway Huang
    Packing Balanced Complete Multipartite Graph with Hexagons. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:71, n:, pp:- [Journal]
  4. Hung-Lin Fu, Christopher A. Rodger
    Almost Resolvable Directed m-cycle systems: m = 3 (mod 6). [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:53, n:, pp:- [Journal]
  5. Hung-Lin Fu, I-Fan Sun
    A Study of the Genus of a Group. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:55, n:, pp:- [Journal]
  6. Yen-Chi Chen, Hung-Lin Fu, I-Fan Sun
    A Study of Typenumber in Book-Embedding. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2002, v:62, n:, pp:- [Journal]
  7. Hui-Lan Fan, Hung-Lin Fu
    The Edge-Coloring of Graphs with Small Genus. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:73, n:, pp:- [Journal]
  8. Hung-Lin Fu, Christopher A. Rodger, Dinesh G. Sarvate
    The existence of group divisible designs with first and second associates, having block size 3. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:54, n:, pp:- [Journal]
  9. Gerard J. Chang, Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang
    Linear k-arboricities on trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:103, n:1-3, pp:281-287 [Journal]
  10. Hung-Lin Fu, Frank K. Hwang
    A novel use of t-packings to construct d-disjunct matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:12, pp:1759-1762 [Journal]
  11. David James Ashe, Hung-Lin Fu, Christopher A. Rodger
    A solution to the forest leave problem for partial 6-cycle systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:281, n:1-3, pp:27-41 [Journal]
  12. Hung-Lin Fu, Wei-Hsin Hu
    A note on ascending subgraph decompositions of complete multipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:226, n:1-3, pp:397-402 [Journal]
  13. Hung-Lin Fu, Wei-Hsin Hu
    Ascending subgraph decompositions of regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:253, n:1-3, pp:11-18 [Journal]
  14. Hung-Lin Fu, Chin-Lin Shiue
    The optimal pebbling number of the complete m-ary tree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:89-100 [Journal]
  15. Darryn E. Bryant, Hung-Lin Fu
    C4-saturated bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:263-268 [Journal]
  16. Hung-Lin Fu, I-Fan Sun
    The typenumber of trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:253, n:1-3, pp:3-10 [Journal]
  17. Hung-Lin Fu, Shung-Liang Wu
    Cyclically decomposing the complete graph into cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:282, n:1-3, pp:267-273 [Journal]
  18. Saad El-Zanati, Hung-Lin Fu, Chin-Lin Shiue
    On the alpha-labeling number of bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:214, n:1-3, pp:241-243 [Journal]
  19. Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger
    Decomposing KncupP into triangles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:284, n:1-3, pp:131-136 [Journal]
  20. Hung-Lin Fu, Ming-Chun Tsai, N. H. Xuong
    The decay number and the maximum genus of diameter 2 graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:226, n:1-3, pp:191-197 [Journal]
  21. Renwang Su, Hung-Lin Fu, Hao Shen
    Embeddings of maximum packings in triple systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:284, n:1-3, pp:235-245 [Journal]
  22. Chin-Lin Shiue, Hung-Lin Fu
    alpha-labeling number of trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:24, pp:3290-3296 [Journal]
  23. Elizabeth J. Billington, Hung-Lin Fu, Christopher A. Rodger
    Packing lambda-Fold Complete Multipartite Graphs with 4-Cycles. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:2, pp:169-186 [Journal]
  24. Shung-Liang Wu, Hung-Lin Fu
    A Note on Cyclic m-cycle Systems of Kr(m). [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2006, v:22, n:3, pp:427-432 [Journal]
  25. Hung-Lin Fu, Frank K. Hwang
    On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2005, v:9, n:3, pp:263-266 [Journal]
  26. Hung-Lin Fu, Christopher A. Rodger
    Group Divisible Designs with Two Associate Classes: n=2 orm=2. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1998, v:83, n:1, pp:94-117 [Journal]
  27. Yukiyasu Mutoh, Toshio Morihara, Masakazu Jimbo, Hung-Lin Fu
    The Existence of 2x4 Grid-Block Designs and Their Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:2, pp:173-178 [Journal]
  28. Hung-Lin Fu
    Intersection problem of Steiner systems S(3, 4, 2nu). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:67, n:3, pp:241-247 [Journal]
  29. Bor-Liang Chen, Chun-Kan Cheng, Hung-Lin Fu, Kuo-Ching Huang
    A study of the total chromatic number of equibipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:184, n:1-3, pp:49-60 [Journal]
  30. Nam-Po Chiang, Hung-Lin Fu
    On upper bounds for the pseudo-achromatic index. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:175, n:1-3, pp:79-86 [Journal]
  31. Hung-Lin Fu
    A note on the ascending subgraph decomposition problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:3, pp:315-318 [Journal]
  32. Nam-Po Chiang, Hung-Lin Fu
    The achromatic indices of the regular complete multipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:61-66 [Journal]
  33. Bor-Liang Chen, Hung-Lin Fu
    Edge domination in complete partite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:132, n:1-3, pp:29-35 [Journal]
  34. Hung-Lin Fu, Kuo-Ching Huang
    On prime labellings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:127, n:1-3, pp:181-186 [Journal]
  35. Hung-Lin Fu, Wei-Hsin Hu
    Disjoint odd integer subsets having a constant odd sum. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:128, n:1-3, pp:143-150 [Journal]
  36. Shung-Liang Wu, Hung-Lin Fu
    Maximum cyclic 4-cycle packings of the complete multipartite graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:14, n:2-3, pp:365-382 [Journal]
  37. Gerard J. Chang, Hung-Lin Fu, Xuding Zhu
    Editorial note. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:14, n:2-3, pp:111-112 [Journal]
  38. Ming-Hway Huang, Chin-Mei Fu, Hung-Lin Fu
    Packing 5-cycles into balanced complete m -partite graphs for odd m. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:14, n:2-3, pp:323-329 [Journal]
  39. Chia-Fen Chang, Hung-Lin Fu
    Near automorphisms of trees with small total relative displacements. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:14, n:2-3, pp:191-195 [Journal]
  40. Jyhmin Kuo, Hung-Lin Fu
    Wide diameters of de Bruijn graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:14, n:2-3, pp:143-152 [Journal]

  41. The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks. [Citation Graph (, )][DBLP]


  42. Nonadaptive algorithms for threshold group testing. [Citation Graph (, )][DBLP]


  43. Optimal conflict-avoiding codes of length n = 0 (mod 16) and weight 3. [Citation Graph (, )][DBLP]


  44. Near automorphisms of cycles. [Citation Graph (, )][DBLP]


  45. Maximal sets of Hamilton cycles in Dn. [Citation Graph (, )][DBLP]


  46. All graphs with maximum degree three whose complements have 4-cycle decompositions. [Citation Graph (, )][DBLP]


  47. Maximal sets of hamilton cycles in K2p-F. [Citation Graph (, )][DBLP]


  48. The linear 3-arboricity of Kn, n and Kn. [Citation Graph (, )][DBLP]


  49. Directed 3-cycle decompositions of complete directed graphs with quadratic leaves. [Citation Graph (, )][DBLP]


  50. Excessive near 1-factorizations. [Citation Graph (, )][DBLP]


  51. Multicolored parallelisms of Hamiltonian cycles. [Citation Graph (, )][DBLP]


  52. Covering graphs with matchings of fixed size. [Citation Graph (, )][DBLP]


Search in 0.030secs, Finished in 0.033secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002