Publication | Date of Publication | Type |
---|
On total coloring of some classes of regular graphs | 2022-08-31 | Paper |
Adjacent vertex distinguishing total coloring in split graphs | 2022-08-24 | Paper |
On ascending subgraph decomposition of graphs | 2022-04-19 | Paper |
On m-cycle holey systems | 2022-04-19 | Paper |
Total colorings of circulant graphs | 2022-02-01 | Paper |
Total Colorings of Some Classes of FourRegular Circulant Graphs | 2021-10-29 | Paper |
Quaternary splitting algorithm in group testing | 2021-05-11 | Paper |
The integer {k}-domination number of circulant graphs | 2021-04-09 | Paper |
Strongly separable matrices for nonadaptive combinatorial group testing | 2021-03-25 | Paper |
Hamiltonicity in prime sum graphs | 2021-03-17 | Paper |
The undirected optical indices of complete \(m\)-ary trees | 2020-08-31 | Paper |
Beyond Hamiltonicity of Prime Difference Graphs | 2020-03-02 | Paper |
Transversals in \(m \times n\) arrays | 2019-08-27 | Paper |
Pack graphs with subgraphs of size three | 2018-10-25 | Paper |
The Undirected Optical Indices of Trees | 2018-08-28 | Paper |
On the number of rainbow spanning trees in edge-colored complete graphs | 2018-06-07 | Paper |
From a Consequence of Bertrand's Postulate to Hamilton Cycles | 2018-04-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q4604193 | 2018-02-23 | Paper |
Learning a hidden uniform hypergraph | 2018-02-09 | Paper |
New bounds on the decycling number of generalized de Bruijn digraphs | 2017-11-29 | Paper |
The Global Packing Number of a Fat-Tree Network | 2017-10-19 | Paper |
The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs | 2017-10-17 | Paper |
Optimal Conflict-Avoiding Codes of Even Length and Weight 3 | 2017-07-27 | Paper |
Errata to “Optimal Conflict-Avoiding Codes of Even Length and Weight 3” [Nov 10 5747-5756] | 2017-07-12 | Paper |
Codes with the identifiable parent property for multimedia fingerprinting | 2017-03-23 | Paper |
Multicolored Isomorphic Spanning Trees in Complete Graphs | 2016-10-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q2804774 | 2016-05-04 | Paper |
Partially user-irrepressible sequence sets and conflict-avoiding codes | 2016-03-09 | Paper |
The Hamilton-Waterloo problem for triangle-factors and heptagon-factors | 2016-03-02 | Paper |
Weighted maximum matchings and optimal equi-difference conflict-avoiding codes | 2015-09-29 | Paper |
New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures | 2015-09-23 | Paper |
New bounds on \(\bar{2}\)-separable codes of length 2 | 2015-01-23 | Paper |
On the decycling number of generalized Kautz digraphs | 2014-12-09 | Paper |
Learning a hidden graph | 2014-12-05 | Paper |
The decycling number of $P_{m} \square P_{n}^{\ast}$ | 2014-09-29 | Paper |
The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures | 2014-08-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5171129 | 2014-07-25 | Paper |
Optimal conflict-avoiding codes of odd length and weight three | 2014-06-27 | Paper |
Edge-colorings of $K_{m,n}$ which Forbid Multicolored Cycles | 2013-09-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q2846654 | 2013-09-09 | Paper |
Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2k ± 1 and Weight 3 | 2013-06-13 | Paper |
A note on optimal pebbling of hypercubes | 2013-06-13 | Paper |
The decycling number of outerplanar graphs | 2013-06-13 | Paper |
Group Testing with Multiple Mutually-Obscuring Positives | 2013-04-09 | Paper |
Feedback vertex set on planar graphs | 2013-02-21 | Paper |
The Hamilton-Waterloo problem for Hamilton cycles and C4k-factors | 2012-10-12 | Paper |
\((4, 5)\)-cycle systems of complete multipartite graphs | 2012-08-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q2881268 | 2012-04-03 | Paper |
Graphs with isomorphic neighbor-subgraphs | 2011-12-19 | Paper |
Reconstruction of hidden graphs and threshold group testing | 2011-09-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q3011714 | 2011-06-29 | Paper |
Sparseness of 4-cycle systems | 2011-05-31 | Paper |
The Existence of $r\times4$ Grid-Block Designs with $r=3,4$ | 2010-06-01 | Paper |
On near relative prime number in a sequence of positive integers | 2010-05-14 | Paper |
Linear 2-arboricity of the complete graph | 2010-05-14 | Paper |
Covering graphs with matchings of fixed size | 2010-03-29 | Paper |
The excessive [3-index of all graphs] | 2010-03-26 | Paper |
Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven | 2010-03-17 | Paper |
On the largest eigenvalues of bipartite graphs which are nearly complete | 2009-12-18 | Paper |
Excessive near 1-factorizations | 2009-12-15 | Paper |
Directed 3-cycle decompositions of complete directed graphs with quadratic leaves | 2009-12-15 | Paper |
Multicolored parallelisms of Hamiltonian cycles | 2009-12-15 | Paper |
Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3 | 2009-10-14 | Paper |
The optimal pebbling number of the caterpillar | 2009-06-30 | Paper |
Nonadaptive algorithms for threshold group testing | 2009-06-30 | Paper |
The IC-indices of complete bipartite graphs | 2009-04-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q5503325 | 2009-01-15 | Paper |
On the diameter of the generalized undirected de Bruijn graphsUGB(n,m),n2<m≤n3 | 2008-12-17 | Paper |
A new construction of \(\bar 3\)-separable matrices via an improved decoding of Macula's construction | 2008-11-19 | Paper |
The Hamilton-Waterloo problem for two even cycles factors | 2008-09-29 | Paper |
On minimum sets of 1-factors covering a complete multipartite graph | 2008-09-04 | Paper |
An upper bound of the number of tests in pooling designs for the error-tolerant complex model | 2008-09-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q3513958 | 2008-07-21 | Paper |
The linear 3-arboricity of \(K_{n,n}\) and \(K_n\) | 2008-07-11 | Paper |
Maximal sets of Hamilton cycles in \(D_n\) | 2008-07-11 | Paper |
Maximal sets of Hamilton cycles in \(K_{2p}-F\) | 2008-05-29 | Paper |
All graphs with maximum degree three whose complements have 4-cycle decompositions | 2008-05-29 | Paper |
Maximum cyclic 4-cycle packings of the complete multipartite graph | 2008-02-18 | Paper |
Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\) | 2008-02-18 | Paper |
Near automorphisms of trees with small total relative displacements | 2008-02-18 | Paper |
Wide diameters of de Bruijn graphs | 2008-02-18 | Paper |
Near automorphisms of cycles | 2008-02-11 | Paper |
Multicolored Parallelisms of Isomorphic Spanning Trees | 2007-09-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q5755102 | 2007-08-20 | Paper |
\(\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-24 | Paper |
A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\) | 2007-01-05 | Paper |
\(\alpha\)-labeling number of trees | 2006-12-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q5492577 | 2006-10-16 | Paper |
A novel use of \(t\)-packings to construct \(d\)-disjunct matrices | 2006-08-14 | Paper |
Partition of a set of integers into subsets with prescribed sums | 2006-06-26 | Paper |
Cyclicm-cycle systems withm ≤ 32 orm = 2q withq a prime power | 2006-03-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q5708581 | 2005-11-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q5708582 | 2005-11-18 | Paper |
On 3-stage Clos networks with different nonblocking requirements on two types of calls | 2005-10-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q5463454 | 2005-08-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q5463530 | 2005-08-04 | Paper |
Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles | 2005-07-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q5461484 | 2005-07-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q5461693 | 2005-07-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q3025197 | 2005-07-13 | Paper |
A resolvable \(r \times c\) grid-block packing and its application to DNA library screening | 2005-04-18 | Paper |
Decomposing \(K_{n} \cup P\) into triangles | 2004-08-20 | Paper |
Embeddings of maximum packings in triple systems | 2004-08-20 | Paper |
A solution to the forest leave problem for partial 6-cycle systems | 2004-08-06 | Paper |
Cyclically decomposing the complete graph into cycles | 2004-08-06 | Paper |
Resolvable even‐cycle systems with a 1‐rotational automorphism | 2004-02-12 | Paper |
The Existence of 2×4 Grid-Block Designs and Their Applications | 2004-01-08 | Paper |
Decomposing complete graphs into \(K_{r} \times K_{c}\)'s. | 2004-01-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q4795889 | 2003-11-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q4798519 | 2003-08-07 | Paper |
\(C_4\)-saturated bipartite graphs | 2003-03-16 | Paper |
1‐rotationally resolvable 4‐cycle systems of 2Kv | 2002-10-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q3147035 | 2002-10-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q4552146 | 2002-08-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q4552194 | 2002-08-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q4552268 | 2002-08-29 | Paper |
The typenumber of trees | 2002-08-29 | Paper |
Ascending subgraph decompositions of regular graphs | 2002-08-29 | Paper |
4-Cycle Group-Divisible Designs with Two Associate Classes | 2002-04-09 | Paper |
The optimal pebbling number of the complete \(m\)-ary tree | 2002-04-08 | Paper |
Four-cycle systems with two-regular leaves | 2002-01-09 | Paper |
Packing complete multipartite graphs with 4-cycles | 2001-10-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q2706952 | 2001-08-27 | Paper |
A note on ascending subgraph decompositions of complete multipartite graphs | 2001-08-02 | Paper |
Linear \(k\)-arboricities on trees | 2001-04-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q2707956 | 2001-04-04 | Paper |
The maximum genus, matchings and the cycle space of a graph | 2000-11-13 | Paper |
A study of the total chromatic number of equibipartite graphs | 2000-11-02 | Paper |
\((m,n)\)-cycle systems | 2000-09-18 | Paper |
Forest leaves and four-cycles | 2000-04-11 | Paper |
On the \(\alpha\)-labeling number of bipartite graphs | 2000-03-23 | Paper |
The Doyen?Wilson theorem for minimum coverings with triples | 1999-05-16 | Paper |
Two Doyen-Wilson theorems for maximum packings with triples | 1999-05-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q4222172 | 1998-12-06 | Paper |
Group divisible designs with two associate classes: \(n=2\) or \(m=2\) | 1998-10-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q3838415 | 1998-08-09 | Paper |
The minimum size of critical sets in latin squares | 1998-06-25 | Paper |
The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-cycles | 1998-03-18 | Paper |
On upper bounds for the pseudo-achromatic index | 1998-03-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4373397 | 1998-01-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4346240 | 1997-10-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q5284654 | 1997-05-19 | Paper |
Connectivity of cages | 1997-02-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q4886767 | 1996-10-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q4881108 | 1996-09-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4873674 | 1996-04-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q4862897 | 1996-02-25 | Paper |
The achromatic indices of the regular complete multipartite graphs | 1995-11-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q4853768 | 1995-11-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4697576 | 1995-08-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q4326214 | 1995-06-08 | Paper |
Edge domination in complete partite graphs | 1995-03-08 | Paper |
On prime labellings | 1994-12-01 | Paper |
Disjoint odd integer subsets having a constant odd sum | 1994-09-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4033693 | 1993-05-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q4017192 | 1993-01-16 | Paper |
Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\) | 1993-01-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q4000772 | 1992-09-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q3984517 | 1992-06-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q3980546 | 1992-06-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q3211888 | 1990-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3360910 | 1990-01-01 | Paper |
More Results on the Intersections of Latin Squares | 1990-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5752582 | 1990-01-01 | Paper |
A note on the ascending subgraph decomposition problem | 1990-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3211346 | 1989-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3824322 | 1989-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3829557 | 1989-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5203021 | 1989-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5752607 | 1989-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4735216 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3829555 | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3831013 | 1987-01-01 | Paper |
Intersection problem of Steiner systems S(3,4,2v) | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3030838 | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3731613 | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3749063 | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3762331 | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3754643 | 1985-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3220595 | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3661590 | 1983-01-01 | Paper |