1. 目前位置：
傅恆霖

傅恆霖 Fu, Hung-Lin

電子郵件／E-mail：hlfu@math.nctu.edu.tw

服務單位／Department：理學院 ／ 應用數學系

著作期間／Publish Period：1989 - 2014-10-01

著作統計／Statistics

Article（109）
Digital Courses（2）
Others（4）
Plan（26）
Proceedings Paper（5）
Thesis（72）

Article

序號
No.		 標題
Title		 著作日期
Date
1 The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures
 2014-10-01
2 Optimal conflict-avoiding codes of odd length and weight three
 2014-08-01
3 New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures
 2013-08-10
4 Reducing Signaling Overhead for Femtocell/Macrocell Networks
 2013-08-01
5 Threshold Group Testing on Inhibitor Model
 2013-06-01
6 A note on optimal pebbling of hypercubes
 2013-05-01
7 The decycling number of outerplanar graphs
 2013-05-01
8 Edge-colorings of K-m,K-n which Forbid Multicolored Cycles 2013-03-01
9 FEEDBACK VERTEX SET ON PLANAR GRAPHS 2012-12-01
10 On the Diameter of the Generalized Undirected De Bruijn Graphs 2012-07-01
11 "(4,5)-CYCLE SYSTEMS OF COMPLETE MULTIPARTITE GRAPHS" 2012-06-01
12 Reconstruction of hidden graphs and threshold group testing
 2011-08-01
13 The Hamilton-Waterloo problem for Hamilton cycles and C(4k)-factors 2011-07-01
14 GRAPHS WITH ISOMORPHIC NEIGHBOR-SUBGRAPHS 2011-06-01
15 Identification and Classification Problems on Pooling Designs for Inhibitor Models
 2010-07-01
16 ON NEAR RELATIVE PRIME NUMBER IN A SEQUENCE OF POSITIVE INTEGERS 2010-02-01
17 LINEAR 2-ARBORICITY OF THE COMPLETE GRAPH 2010-02-01
18 On the largest eigenvalues of bipartite graphs which are nearly complete
 2010-01-15
19 The excessive [3]-index of all graphs 2009-10-05
20 Some Results on 4-cycle Packings 2009-10-01
21 Optimal conflict-avoiding codes of length n equivalent to 0 (mod 16) and weight 3
 2009-09-01
22 Excessive near 1-factorizations
 2009-07-28
23 Directed 3-cycle decompositions of complete directed graphs with quadratic leaves
 2009-07-28
24 Multicolored parallelisms of Hamiltonian cycles
 2009-07-28
25 Nonadaptive algorithms for threshold group testing
 2009-04-06
26 Maximum Packing of Dt-P and Dt boolean OR P with Mendelsohn Triples 2009-04-01
27 THE OPTIMAL PEBBLING NUMBER OF THE CATERPILLAR 2009-04-01
28 The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks
 2009-01-06
29 THE EXISTENCE OF r x 4 GRID-BLOCK DESIGNS WITH r=3, 4
 2009-01-01
30 On the Diameter of the Generalized Graphs UG(B)(n, m), n(2) < m <= n(3)
 2008-12-01
31 A new construction of 3-separable matrices via an improved decoding of Macula's construction
 2008-11-01
32 The linear 3-arboricity of Kn,n and Kn
 2008-09-06
33 Maximal sets of Hamilton cycles in Dn
 2008-08-28
34 Maximal sets of hamilton cycles in K(2p)-F
 2008-07-06
35 All graphs with maximum degree three whose complements have 4-cycle decompositions
 2008-07-06
36 The Hamilton-Waterloo problem for two even cycles factors 2008-07-01
37 On minimum sets of 1-factors covering a complete multipartite graph
 2008-07-01
38 An upper bound of the number of tests in pooling designs for the error-tolerant complex model
 2008-06-01
39 Near automorphisms of cycles
 2008-04-06
40 The IC-indices of complete bipartite graphs 2008-03-12
41 A study of total relative Displacements of permutations in paths and cycles 2008-03-01
42 MINIMIZING SONET ADMs IN UNIDIRECTIONAL WDM RINGS WITH GROOMING RATIO SEVEN
 2008-01-01
43 New results on harmonious trees 2007-11-01
44 alpha-labeling number of trees
 2006-12-28
45 (C)over-right-arrow(4)-decompositions of D-vP and D-v boolean OR P where P is a 2-regular subgraph of D-v 2006-12-01
46 A note on cyclic m-cycle systems of K-r((m))
 2006-11-01
47 A novel use of t-packings to construct d-disjunct matrices
 2006-07-15
48 Multicolored parallelisms of isomorphic spanning trees
 2006-01-01
49 Cyclic m-cycle systems with m <= 32 or m=2(q) with q a prime power
 2006-01-01
50 Partition of a set of integers into subsets, with prescribed sums 2005-12-01
51 All 2-regular leaves of partial 6-cycle systems 2005-07-01
52 Packing lambda-fold complete multipartite graphs with 4-cycles
 2005-06-01
53 On 3-stage Clos networks with different nonblocking requirements on two types of calls
 2005-05-01
54 Packing the Cartesian product of two complete graphs with hexagons 2005-05-01
55 A resolvable r x c grid-block packing and its application to DNA library screening 2004-12-01
56 The edge-coloring of graphs with small genus 2004-10-01
57 Embeddings of maximum packings in triple systems
 2004-07-06
58 Decomposing K-n UP into triangles
 2004-07-06
59 Cyclically decomposing the complete graph into cycles
 2004-05-06
60 A solution to the forest leave problem for partial 6-cycle systems
 2004-04-28
61 Packing balanced complete multipartite graphs with hexagons 2004-04-01
62 Decomposing complete graphs into K-r x K-c's
 2004-02-01
63 The existence of 2x4 grid-block designs and their applications
 2003-01-01
64 Resolvable even-cycle systems with a 1-rotational automorphism
 2003-01-01
65 C-4-saturated bipartite graphs
 2002-12-28
66 Face 2-colorable quadrilateral embeddings of complete bipartite graphs 2002-11-01
67 Ascending subgraph decompositions of regular graphs
 2002-06-06
68 The typenumber of trees
 2002-06-06
69 1-rotationally resolvable 4-cycle systems of 2K(v)
 2002-01-01
70 A study of typenumber in book-embedding 2002-01-01
71 Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs
 2001-09-01
72 4-cycle group-divisible designs with two associate classes
 2001-07-01
73 The decay number and the maximum genus of diameter 2 graphs
 2001-01-06
74 A note on ascending subgraph decompositions of complete multipartite graphs
 2001-01-06
75 Packing complete multipartite graphs with 4-cycles
 2001-01-01
76 Four-cycle systems with two-regular leaves
 2001-01-01
77 On the alpha-labeling number of bipartite graphs 2000-11-01
78 The optimal pebbling number of the complete m-ary tree
 2000-07-28
79 Linear k-arboricities on trees
 2000-07-15
80 A study of the genus of a group 2000-04-01
81 On the alpha-labeling number of bipartite graphs 2000-03-21
82 Forest leaves and four-cycles
 2000-03-01
83 The existence of group divisible designs with first and second associates, having block size 3 2000-01-01
84 Almost Resolvable Directed m-cycle systems: m equivalent to 3 (mod 6) 1999-10-01
85 (m,n)-cycle systems
 1998-11-01
86 Group divisible designs with two associate grasses: n=2 or m=2
 1998-07-01
87 A study of the total chromatic number of equibipartite graphs
 1998-04-06
88 The Doyen-Wilson theorem for maximum packings of K-n with 4-cycles
 1998-03-15
89 The maximum genus, matchings and the cycle space of a graph
 1998-01-01
90 Two Doyen-Wilson theorems for maximum packings with triples
 1998-01-01
91 On the existence of rainbows in 1-factorizations of K-2n
 1998-01-01
92 On upper bounds for the pseudo-achromatic index
 1997-10-15
93 The minimum size of critical sets in latin squares
 1997-08-15
94 Connectivity of cages
 1997-02-01
95 The Doyen-Wilson theorem for minimum coverings with triples
 1997-01-01
96 Total chromatic number of graphs of order 2n+1 having maximum degree 2n-1 1995-12-01
97 THE ACHROMATIC INDEXES OF THE REGULAR COMPLETE MULTIPARTITE GRAPHS
 1995-06-28
98 THE LINEAR 2-ARBORICITY OF COMPLETE BIPARTITE GRAPHS 1994-12-01
99 EDGE DOMINATION IN COMPLETE PARTITE GRAPHS
 1994-09-15
100 DISJOINT ODD INTEGER SUBSETS HAVING A CONSTANT ODD SUM
 1994-04-15
101 ON PRIME LABELINGS
 1994-03-15
102 EMPIRICAL BAYES ESTIMATIONS FOR SOME DISTRIBUTION FAMILIES 1994-01-01
103 TOTAL COLORINGS OF GRAPHS OF ORDER 2N HAVING MAXIMUM DEGREE 2N-2
 1992-01-01
104 THE INTERSECTIONS OF COMMUTATIVE LATIN SQUARES 1991-12-01
105 INFORMATION RATE OF MCELIECE PUBLIC-KEY CRYPTOSYSTEM
 1990-01-04
106 THE MUTUAL INTERSECTIONS OF 3 DISTINCT 1-FACTORIZATIONS 1989-12-01
107 PARTITION A GRAPH INTO ASCENDING SUBGRAPHS 1989-11-01
108 MORE RESULTS ON THE ORTHOGONAL LATIN SQUARE GRAPHS 1989-06-01
109 ON THE INTERSECTIONS OF LATIN SQUARES WITH HOLES 1989-05-01

Digital Courses

序號
No.		 標題
Title		 著作日期
Date
1 離散數學
 2006
2 圖論
 2005

Others

序號
No.		 標題
Title		 著作日期
Date
1 Optimal Conflict-Avoiding Codes of Even Length and Weight 3 (vol 56, pg 5747, 2010)
 2011-08-01
2 Untitled
 2007-10-01
3 Cyclic m-cycle systems with m <= 32 or m=2q with q a prime power (vol 14, pg 66, 2005)
 2006-03-01
4 A NOTE ON THE ASCENDING SUBGRAPH DECOMPOSITION PROBLEM
 1990-10-01

Plan

序號
No.		 標題
Title		 著作日期
Date
1 群試及其應用 2014
2 組合學與離散模型 2013
3 組合學與離散模型 2012
4 組合學與離散模型 2011
5 組合學在計算分子生物學的應用 2010
6 組合學在計算分子生物學的應用 2009
7 數統學門數學組研究發展及推動計畫 2008
8 組合學在計算分子生物學的應用 2008
9 數統學門數學組研究發展及推動計畫
 2007
10 圖-設計的研究(III)
 2007
11 圖-設計的研究(II) 2006
12 數學學門數學組研究發展及推動計畫 2006
13 圖---設計的研究(I)
 2005
14 組合學的應用(III)
 2004
15 組合學的應用(II)
 2003
16 組合學的應用(I)
 2002
17 圖的結構(III) 2001
18 圖的結構(II) 2000
19 圖的結構 2000
20 組合設計的研究(III) 1999
21 組合設計的研究(II) 1998
22 組合設計的研究(I) 1997
23 圖虧格的研究 1996
24 圖的虧格與最大虧格(I) 1995
25 拓樸圖論的研究 1994
26 圖的最大類屬及相關問題 1993

Proceedings Paper

序號
No.		 標題
Title		 著作日期
Date
1 Covering graphs with matchings of fixed size
 2010-01-28
2 Wide diameters of de Bruijn graphs
 2007-10-01
3 Maximum cyclic 4-cycle packings of the complete multipartite graph
 2007-10-01
4 Near automorphisms of trees with small total relative displacements
 2007-10-01
5 Packing 5-cycles into balanced complete m-partite graphs for odd m
 2007-10-01

Thesis

序號
No.		 標題
Title		 著作日期
Date
1 基因排列的中端標記部分剪切問題
 2013
2 圖消圈數的研究
 2013
3 alpha-Domination of Generalized Petersen Graph
 2013
4 以圖為基礎的存取結構上的祕密分享機制之研究
 2013
5 網路中謠言散播中心的研究
 2013
6 乘積圖的反魔方標號及相關缺數問題 2013
7 以圖為基礎之存取結構上的秘密分享機制的平均訊息比率之研究
 2012
8 臉書─小小世界
 2011
9 搜尋散佈謠言者的數學模型
 2011
10 致癌基因樹的重建
 2010
11 完全圖的極大路徑填充
 2010
12 可減魔術三角形的研究
 2009
13 半電力控制集的研究
 2009
14 邊著色圖中的混色子圖
 2009
15 組合群試問題的研究
 2009
16 權重為3 的最優避免衝突碼
 2009
17 圖的有向路徑覆蓋
 2008
18 迴旋碼編碼器其非均等錯誤保護特性之研究
 2008
19 DNA圖的研究
 2008
20 設計高中數學建模課程之研究
 2008
21 排除混色圈的著色完全二分圖
 2008
22 使用循序式演算法尋找隱藏圖
 2007
23 迪布恩圖的直徑與寬直徑
 2007
24 圖轉置的相對變量
 2007
25 圖的圈覆蓋
 2007
26 生物應用衍生的群試問題
 2006
27 郵票問題的研究
 2006
28 羅瓦胥局部引理在匯集設計上的應用
 2006
29 Berge路徑分割猜測的研究
 2006
30 完全圖的路徑分割
 2006
31 在m乘n陣列裡的橫截
 2006
32 圖的臨界圓石分配數
 2005
33 混色同構圖的平行族
 2005
34 完全多部圖之線性k蔭度
 2004
35 圈分割的極圖
 2004
36 二分圖其特徵值的上界
 2004
37 三邊圖裝填的研究
 2003
38 擁有同構鄰子圖的正則圖
 2003
39 圖覆蓋的研究
 2003
40 多重完全圖之混合分解
 2003
41 t-裝填與t-覆蓋 2002
42 小型籠的連通數 2002
43 分割完全圖成有預定長度的路徑 2002
44 史坦納三元系對應圖之最長導出路徑 2002
45 圖的圈填充之研究 2001
46 互質圖的猜測 2001
47 低虧格圖的邊著色 2000
48 互斥路徑的蘭西數 2000
49 圖形的書式嵌入之研究 2000
50 k-強制臨界集的大小 1999
51 變動相對距離和的排列 1999
52 互質圖的研究 1998
53 四點完全圖的最佳填塞與覆蓋之研究 1997
54 二正則有向網路直徑之研究 1997
55 群虧格之研究 1995
56 拉丁方陣中部份全截集長度的研究 1995
57 圖的最大虧格之研究 1995
58 格子圖書式嵌入的型數 1993
59 最大部份平行族的研究 1993
60 圓盤維度為二的平面圖其著色性質之研究 1993
61 有預定最小圓圈對之正則圖的研究 1991
62 最大可嵌入圖的特徵性研究 1991
63 持續長度限制碼之研究 1991
64 完全點著色數及完全邊著色數 1991
65 遞增子圖分割與其相關問題 1991
66 特定形式的圖分割 1990
67 圖的全著色 1990
68 圖型有2n+1個點且最大秩為2n-1的全著色問題 1990
69 不規則性強度問題的研究 1989
70 完全三部份圖的全著色 1989
71 高秩圖的全著色 1989
72 最大星圖 1989
理學院