default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHung-Lin Fu
H. L. Fu
Refine list
refinements active!
zoomed in on 126 of 126 records
view refined list in
export refined list as
showing all 126 records
refine by search term
refine by type
- |
- no options
- temporarily not available
refine by coauthor
- no options
- temporarily not available
refine by orcid
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by access 
- no options
- temporarily not available
2020 – today
- 2025
[j115]Yuan-Hsun Lo
, Hung-Lin Fu, Yijin Zhang, Wing Shing Wong:
The undirected optical indices of trees. J. Comb. Optim. 49(2): 22 (2025)- 2024
- [j114]R. Navaneeth, Jayabalan Geetha, Kanagasabapathi Somasundaram, Hung-Lin Fu:
Total colorings of some classes of four regular circulant graphs. AKCE Int. J. Graphs Comb. 21(1): 1-3 (2024) - 2022
- [j113]Shaily Verma, Hung-Lin Fu, B. S. Panda:
Adjacent vertex distinguishing total coloring in split graphs. Discret. Math. 345(11): 113061 (2022) - [j112]Pei-Duo Yu, Chee Wei Tan, Hung-Lin Fu:
Epidemic Source Detection in Contact Tracing Networks: Epidemic Centrality in Graphs and Message-Passing Algorithms. IEEE J. Sel. Top. Signal Process. 16(2): 234-249 (2022) - [i4]Pei-Duo Yu, Chee-Wei Tan, Hung-Lin Fu:
Epidemic Source Detection in Contact Tracing Networks: Epidemic Centrality in Graphs and Message-Passing Algorithms. CoRR abs/2201.06751 (2022) - 2021
- [j111]Jinping Fan, Hung-Lin Fu, Yujie Gu, Ying Miao, Maiko Shigeno:
Strongly separable matrices for nonadaptive combinatorial group testing. Discret. Appl. Math. 291: 180-187 (2021) - [j110]J. Geetha, K. Somasundaram, Hung-Lin Fu:
Total colorings of circulant graphs. Discret. Math. Algorithms Appl. 13(5): 2150050:1-2150050:10 (2021) - [j109]Hong-Bin Chen, Hung-Lin Fu, Jun-Yi Guo:
Hamiltonicity in Prime Sum Graphs. Graphs Comb. 37(1): 209-219 (2021) - [j108]Jinn Lu, Hung-Lin Fu:
Quaternary splitting algorithm in group testing. J. Comb. Optim. 41(1): 73-79 (2021) - 2020
- [j107]Yuan-Hsun Lo, Hung-Lin Fu, Yijin Zhang, Wing Shing Wong:
The undirected optical indices of complete m-ary trees. Discret. Appl. Math. 285: 173-181 (2020) - [j106]Yen-Jen Cheng, Hung-Lin Fu, Chia-An Liu:
The integer {k}-domination number of circulant graphs. Discret. Math. Algorithms Appl. 12(4): 2050055:1-2050055:9 (2020) - no results
2010 – 2019
- 2019
- [p1]Pei-Duo Yu, Chee-Wei Tan, Hung-Lin Fu:
Rumor Source Detection in Finite Graphs with Boundary Effects by Message-Passing Algorithms. Influence and Behavior Analysis in Social Networks and Social Media 2019: 175-192 - 2018
- [j105]Hung-Lin Fu, Yuan-Hsun Lo, K. E. Perry, C. A. Rodger:
On the number of rainbow spanning trees in edge-colored complete graphs. Discret. Math. 341(8): 2343-2352 (2018) - [j104]Pei-Duo Yu, Chee-Wei Tan, Hung-Lin Fu:
Averting Cascading Failures in Networked Infrastructures: Poset-Constrained Graph Algorithms. IEEE J. Sel. Top. Signal Process. 12(4): 733-748 (2018) - [j103]Huilan Chang, Hung-Lin Fu, Chih-Huai Shih:
Learning a hidden uniform hypergraph. Optim. Lett. 12(1): 55-62 (2018) - [c6]Pei-Duo Yu, Chee-Wei Tan, Hung-Lin Fu:
Graph algorithms for preventing cascading failures in networks. CISS 2018: 1-6 - 2017
- [j102]Hung-Lin Fu:
Rainbow Cycle Designs. Bull. ICA 81: 118-130 (2017) - [j101]Hui-Chuan Lu, Hung-Lin Fu:
The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs. Discret. Appl. Math. 233: 131-142 (2017) - [j100]Minquan Cheng, Hung-Lin Fu, Jing Jiang, Yuan-Hsun Lo, Ying Miao:
Codes with the identifiable parent property for multimedia fingerprinting. Des. Codes Cryptogr. 83(1): 71-82 (2017) - [j99]Jyhmin Kuo, Hung-Lin Fu:
New bounds on the decycling number of generalized de Bruijn digraphs. Discret. Math. Algorithms Appl. 9(5): 1750062:1-1750062:9 (2017) - [j98]Yuan-Hsun Lo, Yijin Zhang, Yi Chen, Hung-Lin Fu, Wing Shing Wong:
The Global Packing Number of a Fat-Tree Network. IEEE Trans. Inf. Theory 63(8): 5327-5335 (2017) - [c5]Pei-Duo Yu, Chee Wei Tan, Hung-Lin Fu:
Rumor Source Detection in Finite Graphs with Boundary Effects by Message-passing Algorithms. ASONAM 2017: 86-90 - [c4]Pei-Duo Yu, Chee-Wei Tan, Hung-Lin Fu:
Rumor source detection in unicyclic graphs. ITW 2017: 439-443 - 2016
- [j97]Yuan-Hsun Lo, Wing Shing Wong, Hung-Lin Fu:
Partially user-irrepressible sequence sets and conflict-avoiding codes. Des. Codes Cryptogr. 78(3): 679-691 (2016) - [j96]Hongchuan Lei, Hung-Lin Fu:
The Hamilton-Waterloo Problem for Triangle-Factors and Heptagon-Factors. Graphs Comb. 32(1): 271-278 (2016) - [c3]Chee Wei Tan, Pei-Duo Yu, Chun-Kiu Lai, Wenyi Zhang, Hung-Lin Fu:
Optimal detection of influential spreaders in online social networks. CISS 2016: 145-150 - 2015
- [j95]Jyhmin Kuo, Hung-Lin Fu:
The Absorbant Number of Generalized de Bruijn Digraphs. Ars Comb. 118: 433-443 (2015) - [j94]Hung-Lin Fu, Yuan-Hsun Lo:
Multicolored Isomorphic Spanning Trees in Complete Graphs. Ars Comb. 122: 423-430 (2015) - [j93]Minquan Cheng, Hung-Lin Fu, Jing Jiang, Yuan-Hsun Lo, Ying Miao:
New bounds on 2-separable codes of length 2. Des. Codes Cryptogr. 74(1): 31-40 (2015) - [j92]Yuan-Hsun Lo, Hung-Lin Fu, Yi-Hean Lin:
Weighted maximum matchings and optimal equi-difference conflict-avoiding codes. Des. Codes Cryptogr. 76(2): 361-372 (2015) - [j91]Min-Yun Lien, Jyhmin Kuo, Hung-Lin Fu:
On the decycling number of generalized Kautz digraphs. Inf. Process. Lett. 115(2): 209-211 (2015) - [i3]Yuan-Hsun Lo, Yijin Zhang, Wing Shing Wong, Hung-Lin Fu:
The Global Packing Number for an Optical Network. CoRR abs/1509.07029 (2015) - 2014
- [j90]Hung-Lin Fu, Yuan-Hsun Lo, Kenneth W. Shum:
Optimal conflict-avoiding codes of odd length and weight three. Des. Codes Cryptogr. 72(2): 289-309 (2014) - [j89]Hui-Chuan Lu, Hung-Lin Fu:
The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures. Des. Codes Cryptogr. 73(1): 37-46 (2014) - [j88]Min-Yun Lien, Hung-Lin Fu, Chie-Huai Shih:
The decycling number of. Discret. Math. Algorithms Appl. 6(3) (2014) - [j87]Huilan Chang, Hung-Lin Fu, Chih-Huai Shih:
Learning a hidden graph. Optim. Lett. 8(8): 2341-2348 (2014) - [i2]Minquan Cheng, Hung-Lin Fu, Jing Jiang, Yuan-Hsun Lo, Ying Miao:
Codes with the Identifiable Parent Property for Multimedia Fingerprinting. CoRR abs/1411.6784 (2014) - [i1]Yuan-Hsun Lo, Wing Shing Wong, Hung-Lin Fu:
Partially user-irrepressible sequence sets and conflict-avoiding codes. CoRR abs/1412.6133 (2014) - 2013
- [j86]Hui-Chuan Lu, Hung-Lin Fu:
New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures. Inf. Sci. 240: 83-94 (2013) - [j85]Huilan Chang, Hung-Lin Fu, Chih-Huai Shih:
Threshold Group Testing on Inhibitor Model. J. Comput. Biol. 20(6): 464-470 (2013) - [j84]Huilan Chang, Hung-Lin Fu, Min-Yun Lien:
The decycling number of outerplanar graphs. J. Comb. Optim. 25(4): 536-542 (2013) - [j83]Hung-Lin Fu, Kuo-Ching Huang, Chin-Lin Shiue:
A note on optimal pebbling of hypercubes. J. Comb. Optim. 25(4): 597-601 (2013) - [c2]Hong-Bin Chen, Hung-Lin Fu:
Group Testing with Multiple Mutually-Obscuring Positives. Information Theory, Combinatorics, and Search Theory 2013: 557-568 - 2012
- [j82]Jyhmin Kuo, Hung-Lin Fu:
On the Diameter of the Generalized Undirected De Bruijn Graphs. Ars Comb. 106: 395-408 (2012) - 2011
- [j81]Renwang Su, Hung-Lin Fu:
Embeddings of Maximum Packings of Triples. Ars Comb. 98: 337-351 (2011) - [j80]Huilan Chang, Hong-Bin Chen, Hung-Lin Fu, Chie-Huai Shi:
Reconstruction of hidden graphs and threshold group testing. J. Comb. Optim. 22(2): 270-281 (2011) - [j79]Hung-Lin Fu, Yi-Hean Lin, Miwako Mishima:
Errata to "Optimal Conflict-Avoiding Codes of Even Length and Weight 3". IEEE Trans. Inf. Theory 57(8): 5572 (2011) - 2010
- [j78]David Cariolaro, Hung-Lin Fu:
Covering graphs with matchings of fixed size. Discret. Math. 310(2): 276-287 (2010) - [j77]Huilan Chang, Hong-Bin Chen, Hung-Lin Fu:
Identification and Classification Problems on Pooling Designs for Inhibitor Models. J. Comput. Biol. 17(7): 927-941 (2010) - [j76]Hung-Lin Fu, Yi-Hean Lin, Miwako Mishima:
Optimal Conflict-Avoiding Codes of Even Length and Weight 3. IEEE Trans. Inf. Theory 56(11): 5747-5756 (2010) - no results
2000 – 2009
- 2009
- [j75]Liqun Pu, Hung-Lin Fu, Hao Shen:
Maximum Packing of Dt - P and Dt U P with Mendelsohn Triples. Ars Comb. 91 (2009) - [j74]Hung-Lin Fu:
Some Results on 4-cycle Packings. Ars Comb. 93 (2009) - [j73]David Cariolaro, Hung-Lin Fu:
The Excessive [3]-Index of All Graphs. Electron. J. Comb. 16(1) (2009) - [j72]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. Discret. Appl. Math. 157(1): 164-169 (2009) - [j71]Hong-Bin Chen, Hung-Lin Fu:
Nonadaptive algorithms for threshold group testing. Discret. Appl. Math. 157(7): 1581-1585 (2009) - [j70]Miwako Mishima, Hung-Lin Fu, Shoichi Uruno:
Optimal conflict-avoiding codes of length n = 0 (mod 16) and weight 3. Des. Codes Cryptogr. 52(3): 275-291 (2009) - [j69]David Cariolaro, Hung-Lin Fu:
Excessive near 1-factorizations. Discret. Math. 309(14): 4690-4696 (2009) - [j68]Liqun Pu, Hung-Lin Fu, Hao Shen:
Directed 3-cycle decompositions of complete directed graphs with quadratic leaves. Discret. Math. 309(14): 4705-4715 (2009) - [j67]Hung-Lin Fu, Yuan-Hsun Lo:
Multicolored parallelisms of Hamiltonian cycles. Discret. Math. 309(14): 4871-4876 (2009) - [j66]Rucong Zhang, Gennian Ge, Alan C. H. Ling, Hung-Lin Fu, Yukiyasu Mutoh:
The Existence of r×4 Grid-Block Designs with r=3, 4. SIAM J. Discret. Math. 23(2): 1045-1062 (2009) - 2008
- [j65]Chin-Lin Shiue, Hung-Lin Fu:
The IC-Indices of Complete Bipartite Graphs. Electron. J. Comb. 15(1) (2008) - [j64]Hung-Lin Fu, Frank K. Hwang:
A new construction of I-separable matrices via an improved decoding of Macula's construction. Discret. Optim. 5(4): 700-704 (2008) - [j63]Chia-Fen Chang, Bor-Liang Chen, Hung-Lin Fu:
Near automorphisms of cycles. Discret. Math. 308(7): 1088-1092 (2008) - [j62]Hung-Lin Fu, S. L. Logan, Christopher A. Rodger:
Maximal sets of hamilton cycles in K2p-F. Discret. Math. 308(13): 2822-2829 (2008) - [j61]Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger, Todd Smith:
All graphs with maximum degree three whose complements have 4-cycle decompositions. Discret. Math. 308(13): 2901-2909 (2008) - [j60]Liqun Pu, Hung-Lin Fu, Hao Shen:
Maximal sets of Hamilton cycles in Dn. Discret. Math. 308(16): 3706-3710 (2008) - [j59]Hung-Lin Fu, Kuo-Ching Huang, Chih-Hung Yen:
The linear 3-arboricity of Kn, n and Kn. Discret. Math. 308(17): 3816-3823 (2008) - [j58]David Cariolaro, Hung-Lin Fu:
On minimum sets of 1-factors covering a complete multipartite graph. J. Graph Theory 58(3): 239-250 (2008) - [j57]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) - [j56]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. Optim. Lett. 2(3): 425-431 (2008) - [j55]Charles J. Colbourn, Hung-Lin Fu, Gennian Ge, Alan C. H. Ling, Hui-Chuan Lu:
Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven. SIAM J. Discret. Math. 23(1): 109-122 (2008) - 2007
- [j54]Gerard J. Chang, Hung-Lin Fu, Xuding Zhu:
Editorial note. J. Comb. Optim. 14(2-3): 111-112 (2007) - [j53]Jyhmin Kuo, Hung-Lin Fu:
Wide diameters of de Bruijn graphs. J. Comb. Optim. 14(2-3): 143-152 (2007) - [j52]Chia-Fen Chang, Hung-Lin Fu:
Near automorphisms of trees with small total relative displacements. J. Comb. Optim. 14(2-3): 191-195 (2007) - [j51]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) - [j50]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
- [j49]Hung-Lin Fu, Frank K. Hwang:
A novel use of t-packings to construct d-disjunct matrices. Discret. Appl. Math. 154(12): 1759-1762 (2006) - [j48]Chin-Lin Shiue, Hung-Lin Fu:
alpha-labeling number of trees. Discret. Math. 306(24): 3290-3296 (2006) - [j47]Shung-Liang Wu, Hung-Lin Fu:
A Note on Cyclic m-cycle Systems of Kr(m). Graphs Comb. 22(3): 427-432 (2006) - [j46]Liqun Pu, Hung-Lin Fu, Hao Shen:
-Decompositions of and Dv UNION P where P is a 2-Regular Subgraph of Dv. Graphs Comb. 22(4): 515-525 (2006) - [j45]Saieed Akbari, Alireza Alipour, Hung-Lin Fu, Yuan-Hsun Lo:
Multicolored Parallelisms of Isomorphic Spanning Trees. SIAM J. Discret. Math. 20(3): 564-567 (2006) - 2005
- [j44]Hung-Lin Fu:
Balanced bipartite 4-cycle designs. Australas. J Comb. 32: 3-26 (2005) - [j43]David James Ashe, Christopher A. Rodger, Hung-Lin Fu:
All 2-Regular Leaves of Partial 6-cycle Systems. Ars Comb. 76 (2005) - [j42]Elizabeth J. Billington, Hung-Lin Fu, Christopher A. Rodger:
Packing lambda-Fold Complete Multipartite Graphs with 4-Cycles. Graphs Comb. 21(2): 169-186 (2005) - [j41]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
- [j40]Hung-Lin Fu, Ming-Hway Huang:
Packing Balanced Complete Multipartite Graph with Hexagons. Ars Comb. 71 (2004) - [j39]Hui-Lan Fan, Hung-Lin Fu:
The Edge-Coloring of Graphs with Small Genus. Ars Comb. 73 (2004) - [j38]David James Ashe, Hung-Lin Fu, Christopher A. Rodger:
A solution to the forest leave problem for partial 6-cycle systems. Discret. Math. 281(1-3): 27-41 (2004) - [j37]Hung-Lin Fu, Shung-Liang Wu:
Cyclically decomposing the complete graph into cycles. Discret. Math. 282(1-3): 267-273 (2004) - [j36]Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger:
Decomposing KncupP into triangles. Discret. Math. 284(1-3): 131-136 (2004) - [j35]Renwang Su, Hung-Lin Fu, Hao Shen:
Embeddings of maximum packings in triple systems. Discret. Math. 284(1-3): 235-245 (2004) - [c1]Ming-Chun Tsai, Hung-Lin Fu:
Edge Number of 3-Connected Diameter 3 Graphs. ISPAN 2004: 364-367 - 2003
- [j34]Yukiyasu Mutoh, Toshio Morihara, Masakazu Jimbo, Hung-Lin Fu:
The Existence of 2x4 Grid-Block Designs and Their Applications. SIAM J. Discret. Math. 16(2): 173-178 (2003) - 2002
- [j33]Yen-Chi Chen, Hung-Lin Fu, I-Fan Sun:
A Study of Typenumber in Book-Embedding. Ars Comb. 62 (2002) - [j32]Hung-Lin Fu, I-Fan Sun:
The typenumber of trees. Discret. Math. 253(1-3): 3-10 (2002) - [j31]Hung-Lin Fu, Wei-Hsin Hu:
Ascending subgraph decompositions of regular graphs. Discret. Math. 253(1-3): 11-18 (2002) - [j30]Darryn E. Bryant, Hung-Lin Fu:
C4-saturated bipartite graphs. Discret. Math. 259(1-3): 263-268 (2002) - [j29]Hung-Lin Fu, Ming-Chun Tsai:
The Maximum Genus of a Graph with Given Diameter and Connectivity. Electron. Notes Discret. Math. 11: 322-329 (2002) - [j28]Hung-Lin Fu, Ming-Chun Tsai:
The Maximum Genus of a Graph with Given Diameter and Connectivity. Electron. Notes Discret. Math. 11: 330-337 (2002) - 2001
- [j27]H. L. Fu, C. A. Rodger:
4-Cycle Group-Divisible Designs with Two Associate Classes. Comb. Probab. Comput. 10(4): 317-343 (2001) - [j26]Hung-Lin Fu, Ming-Chun Tsai, N. H. Xuong:
The decay number and the maximum genus of diameter 2 graphs. Discret. Math. 226(1-3): 191-197 (2001) - [j25]Hung-Lin Fu, Wei-Hsin Hu:
A note on ascending subgraph decompositions of complete multipartite graphs. Discret. Math. 226(1-3): 397-402 (2001) - [j24]H. L. Fu, Christopher A. Rodger:
Four-Cycle Systems with Two-Regular Leaves. Graphs Comb. 17(3): 457-461 (2001) - 2000
- [j23]Hung-Lin Fu, I-Fan Sun:
A Study of the Genus of a Group. Ars Comb. 55 (2000) - [j22]Gerard J. Chang, Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang:
Linear k-arboricities on trees. Discret. Appl. Math. 103(1-3): 281-287 (2000) - [j21]Saad I. El-Zanati, Hung-Lin Fu, Chin-Lin Shiue:
On the alpha-labeling number of bipartite graphs. Discret. Math. 214(1-3): 241-243 (2000) - [j20]Hung-Lin Fu, Chin-Lin Shiue:
The optimal pebbling number of the complete m-ary tree. Discret. Math. 222(1-3): 89-100 (2000) - [j19]Hung-Lin Fu, Christopher A. Rodger:
Forest leaves and four-cycles. J. Graph Theory 33(3): 161-166 (2000) - no results
1990 – 1999
- 1999
- [j18]Hung-Lin Fu, Christopher A. Rodger:
Almost Resolvable Directed m-cycle systems: m = 3 (mod 6). Ars Comb. 53 (1999) - [j17]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
- [j16]H. L. Fu, Charles C. Lindner, C. A. Rodger:
Two Doyen-Wilson theorems for maximum packings with triples. Discret. Math. 178(1-3): 63-71 (1998) - [j15]H. L. Fu, Charles C. Lindner:
The Doyen-Wilson theorem for maximum packings of Kn with 4-cycles. Discret. Math. 183(1-3): 103-117 (1998) - [j14]Bor-Liang Chen, Chun-Kan Cheng, Hung-Lin Fu, Kuo-Ching Huang:
A study of the total chromatic number of equibipartite graphs. Discret. Math. 184(1-3): 49-60 (1998) - [j13]Hung-Lin Fu, Christopher A. Rodger:
Group Divisible Designs with Two Associate Classes: n=2 orm=2. J. Comb. Theory A 83(1): 94-117 (1998) - 1997
- [j12]Nam-Po Chiang, Hung-Lin Fu:
On upper bounds for the pseudo-achromatic index. Discret. Math. 175(1-3): 79-86 (1997) - [j11]Hung-Lin Fu, Kuo-Ching Huang, Christopher A. Rodger:
Connectivity of cages. J. Graph Theory 24(2): 187-191 (1997) - 1996
- [j10]Hung-Lin Fu, Ming-Chun Tsai:
The maximum genus of diameter three graphs. Australas. J Comb. 14: 187-198 (1996) - 1995
- [j9]Nam-Po Chiang, Hung-Lin Fu:
The achromatic indices of the regular complete multipartite graphs. Discret. Math. 141(1-3): 61-66 (1995) - 1994
- [j8]Hung-Lin Fu, Kuo-Ching Huang:
On prime labellings. Discret. Math. 127(1-3): 181-186 (1994) - [j7]Hung-Lin Fu, Wei-Hsin Hu:
Disjoint odd integer subsets having a constant odd sum. Discret. Math. 128(1-3): 143-150 (1994) - [j6]Bor-Liang Chen, Hung-Lin Fu:
Edge domination in complete partite graphs. Discret. Math. 132(1-3): 29-35 (1994) - 1992
- [j5]Nam-Po Chiang, Hung-Lin Fu:
On the achromatic number of the Cartesian product G1×G2. Australas. J Comb. 6: 111-118 (1992) - [j4]Bor-Liang Chen, Hung-Lin Fu:
Total colorings of graphs of order 2n having maximum degree 2n-2. Graphs Comb. 8(2): 119-123 (1992) - 1991
- [j3]Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang:
Decomposing graphs into forests of paths with size less than three. Australas. J Comb. 3: 55-74 (1991) - 1990
- [j2]Hung-Lin Fu:
A note on the ascending subgraph decomposition problem. Discret. Math. 84(3): 315-318 (1990) - no results
1980 – 1989
- 1987
- [j1]Hung-Lin Fu:
Intersection problem of Steiner systems S(3, 4, 2nu). Discret. Math. 67(3): 241-247 (1987) - no results
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-05 00:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
