Hung-Lin Fu

From MaRDI portal
Revision as of 10:58, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Hung-Lin Fu to Hung-Lin Fu: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:439195

Available identifiers

zbMath Open fu.hunglinWikidataQ102171117 ScholiaQ102171117MaRDI QIDQ439195

List of research outcomes





PublicationDate of PublicationType
Total colorings of some classes of four regular circulant graphs2024-12-10Paper
On total coloring of some classes of regular graphs2022-08-31Paper
Adjacent vertex distinguishing total coloring in split graphs2022-08-24Paper
On ascending subgraph decomposition of graphs2022-04-19Paper
On m-cycle holey systems2022-04-19Paper
Total colorings of circulant graphs2022-02-01Paper
Total Colorings of Some Classes of FourRegular Circulant Graphs2021-10-29Paper
Quaternary splitting algorithm in group testing2021-05-11Paper
The integer {k}-domination number of circulant graphs2021-04-09Paper
Strongly separable matrices for nonadaptive combinatorial group testing2021-03-25Paper
Hamiltonicity in prime sum graphs2021-03-17Paper
The undirected optical indices of complete \(m\)-ary trees2020-08-31Paper
Beyond Hamiltonicity of Prime Difference Graphs2020-03-02Paper
Transversals in \(m \times n\) arrays2019-08-27Paper
Pack graphs with subgraphs of size three2018-10-25Paper
The Undirected Optical Indices of Trees2018-08-28Paper
On the number of rainbow spanning trees in edge-colored complete graphs2018-06-07Paper
From a Consequence of Bertrand's Postulate to Hamilton Cycles2018-04-19Paper
https://portal.mardi4nfdi.de/entity/Q46041932018-02-23Paper
Learning a hidden uniform hypergraph2018-02-09Paper
New bounds on the decycling number of generalized de Bruijn digraphs2017-11-29Paper
The Global Packing Number of a Fat-Tree Network2017-10-19Paper
The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs2017-10-17Paper
Optimal Conflict-Avoiding Codes of Even Length and Weight 32017-07-27Paper
Errata to “Optimal Conflict-Avoiding Codes of Even Length and Weight 3” [Nov 10 5747-5756]2017-07-12Paper
Codes with the identifiable parent property for multimedia fingerprinting2017-03-23Paper
Multicolored Isomorphic Spanning Trees in Complete Graphs2016-10-06Paper
https://portal.mardi4nfdi.de/entity/Q28047742016-05-04Paper
Partially user-irrepressible sequence sets and conflict-avoiding codes2016-03-09Paper
The Hamilton-Waterloo problem for triangle-factors and heptagon-factors2016-03-02Paper
Weighted maximum matchings and optimal equi-difference conflict-avoiding codes2015-09-29Paper
New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures2015-09-23Paper
New bounds on \(\bar{2}\)-separable codes of length 22015-01-23Paper
On the decycling number of generalized Kautz digraphs2014-12-09Paper
Learning a hidden graph2014-12-05Paper
The decycling number of $P_{m} \square P_{n}^{\ast}$2014-09-29Paper
The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures2014-08-01Paper
https://portal.mardi4nfdi.de/entity/Q51711292014-07-25Paper
Optimal conflict-avoiding codes of odd length and weight three2014-06-27Paper
Edge-colorings of $K_{m,n}$ which Forbid Multicolored Cycles2013-09-26Paper
https://portal.mardi4nfdi.de/entity/Q28466542013-09-09Paper
A note on optimal pebbling of hypercubes2013-06-13Paper
The decycling number of outerplanar graphs2013-06-13Paper
Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2k ± 1 and Weight 32013-06-13Paper
Group Testing with Multiple Mutually-Obscuring Positives2013-04-09Paper
Feedback vertex set on planar graphs2013-02-21Paper
The Hamilton-Waterloo problem for Hamilton cycles and C4k-factors2012-10-12Paper
\((4, 5)\)-cycle systems of complete multipartite graphs2012-08-01Paper
https://portal.mardi4nfdi.de/entity/Q28812682012-04-03Paper
Graphs with isomorphic neighbor-subgraphs2011-12-19Paper
Reconstruction of hidden graphs and threshold group testing2011-09-27Paper
https://portal.mardi4nfdi.de/entity/Q30117142011-06-29Paper
Sparseness of 4-cycle systems2011-05-31Paper
The Existence of $r\times4$ Grid-Block Designs with $r=3,4$2010-06-01Paper
On near relative prime number in a sequence of positive integers2010-05-14Paper
Linear 2-arboricity of the complete graph2010-05-14Paper
Covering graphs with matchings of fixed size2010-03-29Paper
The excessive [3-index of all graphs]2010-03-26Paper
Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven2010-03-17Paper
On the largest eigenvalues of bipartite graphs which are nearly complete2009-12-18Paper
Excessive near 1-factorizations2009-12-15Paper
Directed 3-cycle decompositions of complete directed graphs with quadratic leaves2009-12-15Paper
Multicolored parallelisms of Hamiltonian cycles2009-12-15Paper
Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 32009-10-14Paper
The optimal pebbling number of the caterpillar2009-06-30Paper
Nonadaptive algorithms for threshold group testing2009-06-30Paper
The IC-indices of complete bipartite graphs2009-04-07Paper
https://portal.mardi4nfdi.de/entity/Q55033252009-01-15Paper
On the diameter of the generalized undirected de Bruijn graphsUGB(n,m),n2<mn32008-12-17Paper
A new construction of \(\bar 3\)-separable matrices via an improved decoding of Macula's construction2008-11-19Paper
The Hamilton-Waterloo problem for two even cycles factors2008-09-29Paper
An upper bound of the number of tests in pooling designs for the error-tolerant complex model2008-09-04Paper
On minimum sets of 1-factors covering a complete multipartite graph2008-09-04Paper
https://portal.mardi4nfdi.de/entity/Q35139582008-07-21Paper
The linear 3-arboricity of \(K_{n,n}\) and \(K_n\)2008-07-11Paper
Maximal sets of Hamilton cycles in \(D_n\)2008-07-11Paper
Maximal sets of Hamilton cycles in \(K_{2p}-F\)2008-05-29Paper
All graphs with maximum degree three whose complements have 4-cycle decompositions2008-05-29Paper
Maximum cyclic 4-cycle packings of the complete multipartite graph2008-02-18Paper
Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\)2008-02-18Paper
Near automorphisms of trees with small total relative displacements2008-02-18Paper
Wide diameters of de Bruijn graphs2008-02-18Paper
Near automorphisms of cycles2008-02-11Paper
Multicolored Parallelisms of Isomorphic Spanning Trees2007-09-06Paper
https://portal.mardi4nfdi.de/entity/Q57551022007-08-20Paper
\(\vec C_4\)-decompositions of \(D_v\backslash P\) and \(D_{v}\cup P\) where \(P\) is a 2-regular subgraph of \(D_{v}\)2007-05-24Paper
A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\)2007-01-05Paper
\(\alpha\)-labeling number of trees2006-12-14Paper
https://portal.mardi4nfdi.de/entity/Q54925772006-10-16Paper
A novel use of \(t\)-packings to construct \(d\)-disjunct matrices2006-08-14Paper
Partition of a set of integers into subsets with prescribed sums2006-06-26Paper
Cyclicm-cycle systems withm ≤ 32 orm = 2q withq a prime power2006-03-24Paper
https://portal.mardi4nfdi.de/entity/Q57085812005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q57085822005-11-18Paper
On 3-stage Clos networks with different nonblocking requirements on two types of calls2005-10-18Paper
https://portal.mardi4nfdi.de/entity/Q54634542005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54635302005-08-04Paper
Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles2005-07-28Paper
https://portal.mardi4nfdi.de/entity/Q54614842005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q54616932005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q30251972005-07-13Paper
A resolvable \(r \times c\) grid-block packing and its application to DNA library screening2005-04-18Paper
Decomposing \(K_{n} \cup P\) into triangles2004-08-20Paper
Embeddings of maximum packings in triple systems2004-08-20Paper
A solution to the forest leave problem for partial 6-cycle systems2004-08-06Paper
Cyclically decomposing the complete graph into cycles2004-08-06Paper
Resolvable even‐cycle systems with a 1‐rotational automorphism2004-02-12Paper
The Existence of 2×4 Grid-Block Designs and Their Applications2004-01-08Paper
Decomposing complete graphs into \(K_{r} \times K_{c}\)'s.2004-01-06Paper
https://portal.mardi4nfdi.de/entity/Q47958892003-11-05Paper
https://portal.mardi4nfdi.de/entity/Q47985192003-08-07Paper
\(C_4\)-saturated bipartite graphs2003-03-16Paper
https://portal.mardi4nfdi.de/entity/Q31470352002-10-09Paper
1‐rotationally resolvable 4‐cycle systems of 2Kv2002-10-09Paper
The typenumber of trees2002-08-29Paper
Ascending subgraph decompositions of regular graphs2002-08-29Paper
https://portal.mardi4nfdi.de/entity/Q45521462002-08-29Paper
https://portal.mardi4nfdi.de/entity/Q45521942002-08-29Paper
https://portal.mardi4nfdi.de/entity/Q45522682002-08-29Paper
4-Cycle Group-Divisible Designs with Two Associate Classes2002-04-09Paper
The optimal pebbling number of the complete \(m\)-ary tree2002-04-08Paper
Four-cycle systems with two-regular leaves2002-01-09Paper
Packing complete multipartite graphs with 4-cycles2001-10-21Paper
https://portal.mardi4nfdi.de/entity/Q27069522001-08-27Paper
A note on ascending subgraph decompositions of complete multipartite graphs2001-08-02Paper
Linear \(k\)-arboricities on trees2001-04-09Paper
https://portal.mardi4nfdi.de/entity/Q27079562001-04-04Paper
The maximum genus, matchings and the cycle space of a graph2000-11-13Paper
A study of the total chromatic number of equibipartite graphs2000-11-02Paper
\((m,n)\)-cycle systems2000-09-18Paper
Forest leaves and four-cycles2000-04-11Paper
On the \(\alpha\)-labeling number of bipartite graphs2000-03-23Paper
The Doyen?Wilson theorem for minimum coverings with triples1999-05-16Paper
Two Doyen-Wilson theorems for maximum packings with triples1999-05-03Paper
https://portal.mardi4nfdi.de/entity/Q42221721998-12-06Paper
Group divisible designs with two associate classes: \(n=2\) or \(m=2\)1998-10-18Paper
https://portal.mardi4nfdi.de/entity/Q38384151998-08-09Paper
The minimum size of critical sets in latin squares1998-06-25Paper
The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-cycles1998-03-18Paper
On upper bounds for the pseudo-achromatic index1998-03-11Paper
https://portal.mardi4nfdi.de/entity/Q43733971998-01-21Paper
https://portal.mardi4nfdi.de/entity/Q43462401997-10-16Paper
https://portal.mardi4nfdi.de/entity/Q52846541997-05-19Paper
Connectivity of cages1997-02-20Paper
https://portal.mardi4nfdi.de/entity/Q48867671996-10-15Paper
https://portal.mardi4nfdi.de/entity/Q48811081996-09-01Paper
https://portal.mardi4nfdi.de/entity/Q48736741996-04-17Paper
https://portal.mardi4nfdi.de/entity/Q48628971996-02-25Paper
The achromatic indices of the regular complete multipartite graphs1995-11-27Paper
https://portal.mardi4nfdi.de/entity/Q48537681995-11-01Paper
https://portal.mardi4nfdi.de/entity/Q46975761995-08-27Paper
https://portal.mardi4nfdi.de/entity/Q43262141995-06-08Paper
Edge domination in complete partite graphs1995-03-08Paper
On prime labellings1994-12-01Paper
Disjoint odd integer subsets having a constant odd sum1994-09-11Paper
https://portal.mardi4nfdi.de/entity/Q40336931993-05-16Paper
Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40171921993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40007721992-09-26Paper
https://portal.mardi4nfdi.de/entity/Q39845171992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39805461992-06-26Paper
A note on the ascending subgraph decomposition problem1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32118881990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33609101990-01-01Paper
More Results on the Intersections of Latin Squares1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57525821990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32113461989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38243221989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38295571989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52030211989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57526071989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47352161988-01-01Paper
Intersection problem of Steiner systems S(3,4,2v)1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30308381987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38295551987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38310131987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37316131986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37490631986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37623311986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37546431985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32205951984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36615901983-01-01Paper

Research outcomes over time

This page was built for person: Hung-Lin Fu