The following pages link to Hung-Lin Fu (Q439195):
Displayed 50 items.
- Item:Q439195 (redirect page) (← links)
- Item:Q222621 (redirect page) (← links)
- Partially user-irrepressible sequence sets and conflict-avoiding codes (Q256572) (← links)
- \((4, 5)\)-cycle systems of complete multipartite graphs (Q439196) (← links)
- On the decycling number of generalized Kautz digraphs (Q477628) (← links)
- Learning a hidden graph (Q479267) (← links)
- New bounds on \(\bar{2}\)-separable codes of length 2 (Q488247) (← links)
- New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures (Q497216) (← links)
- Weighted maximum matchings and optimal equi-difference conflict-avoiding codes (Q498989) (← links)
- Codes with the identifiable parent property for multimedia fingerprinting (Q517266) (← links)
- Graphs with isomorphic neighbor-subgraphs (Q652105) (← links)
- Learning a hidden uniform hypergraph (Q683922) (← links)
- Reconstruction of hidden graphs and threshold group testing (Q719032) (← links)
- Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3 (Q735031) (← links)
- A note on the ascending subgraph decomposition problem (Q750466) (← links)
- A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\) (Q855298) (← links)
- \(\alpha\)-labeling number of trees (Q856879) (← links)
- \(\vec C_4\)-decompositions of \(D_v\backslash P\) and \(D_{v}\cup P\) where \(P\) is a 2-regular subgraph of \(D_{v}\) (Q882791) (← links)
- Maximal sets of Hamilton cycles in \(K_{2p}-F\) (Q924970) (← links)
- All graphs with maximum degree three whose complements have 4-cycle decompositions (Q924981) (← links)
- The linear 3-arboricity of \(K_{n,n}\) and \(K_n\) (Q932632) (← links)
- Maximal sets of Hamilton cycles in \(D_n\) (Q932696) (← links)
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model (Q941032) (← links)
- The Hamilton-Waterloo problem for two even cycles factors (Q947044) (← links)
- A new construction of \(\bar 3\)-separable matrices via an improved decoding of Macula's construction (Q955328) (← links)
- Covering graphs with matchings of fixed size (Q960925) (← links)
- On near relative prime number in a sequence of positive integers (Q971510) (← links)
- Linear 2-arboricity of the complete graph (Q971523) (← links)
- The IC-indices of complete bipartite graphs (Q1010754) (← links)
- The optimal pebbling number of the caterpillar (Q1026956) (← links)
- Nonadaptive algorithms for threshold group testing (Q1028130) (← links)
- On the largest eigenvalues of bipartite graphs which are nearly complete (Q1044557) (← links)
- Excessive near 1-factorizations (Q1044935) (← links)
- Directed 3-cycle decompositions of complete directed graphs with quadratic leaves (Q1044938) (← links)
- Multicolored parallelisms of Hamiltonian cycles (Q1044961) (← links)
- Intersection problem of Steiner systems S(3,4,2v) (Q1097890) (← links)
- Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\) (Q1196563) (← links)
- Group divisible designs with two associate classes: \(n=2\) or \(m=2\) (Q1268606) (← links)
- \((m,n)\)-cycle systems (Q1299002) (← links)
- Disjoint odd integer subsets having a constant odd sum (Q1322179) (← links)
- On prime labellings (Q1322227) (← links)
- Edge domination in complete partite graphs (Q1336647) (← links)
- The minimum size of critical sets in latin squares (Q1367673) (← links)
- On upper bounds for the pseudo-achromatic index (Q1377748) (← links)
- Two Doyen-Wilson theorems for maximum packings with triples (Q1377858) (← links)
- The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-cycles (Q1382820) (← links)
- Decomposing complete graphs into \(K_{r} \times K_{c}\)'s. (Q1417807) (← links)
- Linear \(k\)-arboricities on trees (Q1570841) (← links)
- The optimal pebbling number of the complete \(m\)-ary tree (Q1579551) (← links)
- A study of the total chromatic number of equibipartite graphs (Q1584229) (← links)
- The typenumber of trees (Q1613512) (← links)