The following pages link to Hung-Lin Fu (Q439195):
Displayed 50 items.
- Ascending subgraph decompositions of regular graphs (Q1613513) (← links)
- On the number of rainbow spanning trees in edge-colored complete graphs (Q1637154) (← links)
- A resolvable \(r \times c\) grid-block packing and its application to DNA library screening (Q1771534) (← links)
- A solution to the forest leave problem for partial 6-cycle systems (Q1827694) (← links)
- Cyclically decomposing the complete graph into cycles (Q1827757) (← links)
- A note on ascending subgraph decompositions of complete multipartite graphs (Q1841928) (← links)
- \(C_4\)-saturated bipartite graphs (Q1861219) (← links)
- Decomposing \(K_{n} \cup P\) into triangles (Q1876681) (← links)
- Embeddings of maximum packings in triple systems (Q1876696) (← links)
- The achromatic indices of the regular complete multipartite graphs (Q1894758) (← links)
- Feedback vertex set on planar graphs (Q1936089) (← links)
- A note on optimal pebbling of hypercubes (Q1956255) (← links)
- The decycling number of outerplanar graphs (Q1956257) (← links)
- On the \(\alpha\)-labeling number of bipartite graphs (Q1972146) (← links)
- Pack graphs with subgraphs of size three (Q1990360) (← links)
- Quaternary splitting algorithm in group testing (Q2025097) (← links)
- Adjacent vertex distinguishing total coloring in split graphs (Q2166305) (← links)
- On total coloring of some classes of regular graphs (Q2167796) (← links)
- The undirected optical indices of complete \(m\)-ary trees (Q2197416) (← links)
- Optimal conflict-avoiding codes of odd length and weight three (Q2248642) (← links)
- Transversals in \(m \times n\) arrays (Q2320748) (← links)
- The excessive [3]-index of all graphs (Q2380288) (← links)
- The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs (Q2410257) (← links)
- Near automorphisms of cycles (Q2469986) (← links)
- Maximum cyclic 4-cycle packings of the complete multipartite graph (Q2471047) (← links)
- Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\) (Q2471048) (← links)
- Near automorphisms of trees with small total relative displacements (Q2471065) (← links)
- Wide diameters of de Bruijn graphs (Q2471070) (← links)
- Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles (Q2484153) (← links)
- Partition of a set of integers into subsets with prescribed sums (Q2493636) (← links)
- A novel use of \(t\)-packings to construct \(d\)-disjunct matrices (Q2499596) (← links)
- The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures (Q2510652) (← links)
- On 3-stage Clos networks with different nonblocking requirements on two types of calls (Q2569163) (← links)
- Hamiltonicity in prime sum graphs (Q2657078) (← links)
- Strongly separable matrices for nonadaptive combinatorial group testing (Q2659071) (← links)
- (Q2706952) (← links)
- (Q2707956) (← links)
- Packing complete multipartite graphs with 4-cycles (Q2713360) (← links)
- 4-Cycle Group-Divisible Designs with Two Associate Classes (Q2757075) (← links)
- (Q2804774) (← links)
- Multicolored Isomorphic Spanning Trees in Complete Graphs (Q2823226) (← links)
- (Q2846654) (← links)
- Edge-colorings of $K_{m,n}$ which Forbid Multicolored Cycles (Q2848790) (← links)
- (Q2881268) (← links)
- The decycling number of $P_{m} \square P_{n}^{\ast}$ (Q2920881) (← links)
- Sparseness of 4-cycle systems (Q3003887) (← links)
- (Q3011714) (← links)
- (Q3025197) (← links)
- (Q3030838) (← links)
- (Q3147035) (← links)