Katherine Heinrich

According to our database1, Katherine Heinrich authored at least 31 papers between 1978 and 2000.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2000
Partitioning infinite trees.
J. Graph Theory, 2000

1999
<i>P</i><sub>4</sub>-decompositions of regular graphs.
J. Graph Theory, 1999

General Upper Bounds on the Minimum Size of Covering Designs.
J. Comb. Theory A, 1999

On group divisible covering designs.
Discret. Math., 1999

1998
Triangle-Free Circuit Decompositions and Petersen Minor.
J. Comb. Theory B, 1998

1996
Perfect double covers with paths of length four.
J. Graph Theory, 1996

A solution of Dudeney's round table problem for p^eq^f + 1.
Ars Comb., 1996

1995
Isomorphic factorizations of trees.
J. Graph Theory, 1995

1992
Conflict-Free Access to Parallel Memories.
J. Parallel Distributed Comput., 1992

Perfect Latin Squares.
Discret. Appl. Math., 1992

1991
Characterization of a class of triangle-free graphs with a certain adjacency property.
J. Graph Theory, 1991

Incomplete self-orthogonal latin squares ISOLS(6m + 6, 2m) exist for all m.
Discret. Math., 1991

Dudeney's round table problem.
Discret. Math., 1991

Simple direct constructions for hybrid triple designs.
Discret. Math., 1991

1990
Coloring the edges of <i>k<sub>m</sub></i> × <i>k<sub>m</sub></i>.
J. Graph Theory, 1990

On Resolvable Mixed Path Designs.
Eur. J. Comb., 1990

Existence of Resolvable Path Designs.
Eur. J. Comb., 1990

A simple existence criterion for (g<f)- factors.
Discret. Math., 1990

Matching designs.
Australas. J Comb., 1990

1989
Combinatorial Designs (W. D. Wallis).
SIAM Rev., 1989

Near 2-factorizations of 2<i>K</i><sub><i>n</i></sub>: Cycles of even length.
Graphs Comb., 1989

On Alspach's conjecture.
Discret. Math., 1989

1988
A lower bound on the number of spanning trees with <i>k</i> end-vertices.
J. Graph Theory, 1988

Almost resolvable decompositions of 2<i>K</i><sub><i>n</i></sub> into cycles of odd length.
J. Comb. Theory A, 1988

1987
Exact coverings of 2-paths by 4-cycles.
J. Comb. Theory A, 1987

On the problem of bandsize.
Graphs Comb., 1987

1986
Existence of orthogonal latin squares with aligned subsquares.
Discret. Math., 1986

1983
Partitioning oriented 2-paths.
J. Graph Theory, 1983

Doubly diagonal orthogonal latin squares.
Discret. Math., 1983

1980
Latin Squares with No Proper Subsquares.
J. Comb. Theory A, 1980

1978
Graphs with symmetric automorphism group.
J. Graph Theory, 1978


  Loading...