Hans-Dietrich O. F. Gronau

Affiliations:
  • University of Rostock, Germany


According to our database1, Hans-Dietrich O. F. Gronau authored at least 33 papers between 1979 and 2014.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2014
Preface.
Discret. Appl. Math., 2014

2013
Completely separating systems of k-sets for (<sup>k-1</sup><sub>2</sub>) ≤ n < (<sup>k</sup><sub>2</sub>) or 11 ≤ k ≤ 12.
Australas. J Comb., 2013

2009
Orthogonal covers by multiplication graphs.
Discret. Appl. Math., 2009

Preface.
Discret. Appl. Math., 2009

2005
Some Ramsey Schur Numbers.
Comb. Probab. Comput., 2005

2004
Super-simple (v, 5, 2)-designs.
Discret. Appl. Math., 2004

Orthogonal double covers of K<sub>n, n</sub> by small graphs.
Discret. Appl. Math., 2004

Preface: ODSA.
Discret. Appl. Math., 2004

2002
On Orthogonal Double Covers of Graphs.
Des. Codes Cryptogr., 2002

2000
Symmetric Graph Designs.
Graphs Comb., 2000

1999
The Automorphism Group of the Subsequence Poset <i>B</i><i>m</i>, <i>n</i>.
Order, 1999

1997
Orthogonal Double Covers of Complete Graphs by Trees.
Graphs Comb., 1997

1996
On posets of m-ary words.
Discret. Math., 1996

1995
On a Problem of Hering Concerning Orthogonal Covers of K<sub>n</sub>.
J. Comb. Theory A, 1995

The closure of all subsets of {3, 4, ...10} which include 3.
Ars Comb., 1995

1994
Ramsey numbers for sets of small graphs.
Discret. Math., 1994

1991
Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions.
Discret. Math., 1991

1987
Efficient Algorithmic Construction of Designs.
Proceedings of the Fundamentals of Computation Theory, 1987

1986
An extremal coloring problem on matrices.
Discret. Math., 1986

An Erdős-Ko-Rado Type Theorem II.
Acta Cybern., 1986

1985
An intersection-union theorem for integer sequences.
Discret. Math., 1985

1983
More on the Erdös-Ko-Rado Theorem for Integer Sequences.
J. Comb. Theory A, 1983

Maximum Nontrivial k-uniform Set Families in Which no µ Sets Have an Empty Intersection.
J. Inf. Process. Cybern., 1983

1982
On Sperner families in which no k sets have an empty intersection III.
Comb., 1982

Maximal families of restricted subsets of a finite set.
Acta Cybern., 1982

1981
On Sperner Families in Which No k Sets Have an Empty Intersection, II.
J. Comb. Theory A, 1981

Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices I.
Discret. Math., 1981

On maximal families of subsets of a finite set.
Discret. Math., 1981

On maximal antichains containing no set and its complement.
Discret. Math., 1981

1980
On Maximal Antichains Consisting of Sets and Their Complements.
J. Comb. Theory A, 1980

On Sperner Families in which No K Sets Have an Empty Intersection.
J. Comb. Theory A, 1980

1979
Recognition of monotone functions.
Acta Cybern., 1979

On Sperner families in which no 3 sets have an empty intersection.
Acta Cybern., 1979


  Loading...