Katherine Heinrich

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2000

Partitioning infinite trees.

Peter Horák, Katherine Heinrich

J. Graph Theory, 2000

1999

<i>P</i>₄-decompositions of regular graphs.

Katherine Heinrich, Jiping Liu, Min-Li Yu

J. Graph Theory, 1999

General Upper Bounds on the Minimum Size of Covering Designs.

Iliya Bluskov, Katherine Heinrich

J. Comb. Theory A, 1999

On group divisible covering designs.

Katherine Heinrich, Jianxing Yin

Discret. Math., 1999

1998

Triangle-Free Circuit Decompositions and Petersen Minor.

Katherine Heinrich, Jiping Liu, Cun-Quan Zhang

J. Comb. Theory B, 1998

1996

Perfect double covers with paths of length four.

Katherine Heinrich, P. Horak, Walter D. Wallis, Qinglin Yu

J. Graph Theory, 1996

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

Katherine Heinrich, Midori Kobayashi, Gisaku Nakamura

Ars Comb., 1996

1995

Isomorphic factorizations of trees.

Katherine Heinrich, Peter Horák

J. Graph Theory, 1995

1992

Conflict-Free Access to Parallel Memories.

Charles J. Colbourn, Katherine Heinrich

J. Parallel Distributed Comput., 1992

Perfect Latin Squares.

Katherine Heinrich, Kichul Kim, Viktor K. Prasanna

Discret. Appl. Math., 1992

1991

Characterization of a class of triangle-free graphs with a certain adjacency property.

Brian Alspach, C. C. Chen, Katherine Heinrich

J. Graph Theory, 1991

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

Katherine Heinrich, Lisheng Wu, Lie Zhu

Discret. Math., 1991

Dudeney's round table problem.

Katherine Heinrich, Midori Kobayashi, Gisaku Nakamura

Discret. Math., 1991

Simple direct constructions for hybrid triple designs.

Katherine Heinrich

Discret. Math., 1991

1990

Coloring the edges of <i>k_m</i> × <i>k_m</i>.

Katherine Heinrich

J. Graph Theory, 1990

On Resolvable Mixed Path Designs.

Jean-Claude Bermond, Katherine Heinrich, Min-Li Yu

Eur. J. Comb., 1990

Existence of Resolvable Path Designs.

Jean-Claude Bermond, Katherine Heinrich, Min-Li Yu

Eur. J. Comb., 1990

A simple existence criterion for (g<f)- factors.

Katherine Heinrich, Pavol Hell, David G. Kirkpatrick, Guizhen Liu

Discret. Math., 1990

Matching designs.

Brian Alspach, Katherine Heinrich

Australas. J Comb., 1990

1989

Combinatorial Designs (W. D. Wallis).

Katherine Heinrich

SIAM Rev., 1989

Near 2-factorizations of 2<i>K</i>_<i>n</i>: Cycles of even length.

James Burling, Katherine Heinrich

Graphs Comb., 1989

On Alspach's conjecture.

Katherine Heinrich, Peter Horák, Alexander Rosa

Discret. Math., 1989

1988

A lower bound on the number of spanning trees with <i>k</i> end-vertices.

Katherine Heinrich, Guizhen Liu

J. Graph Theory, 1988

Almost resolvable decompositions of 2<i>K</i>_<i>n</i> into cycles of odd length.

Katherine Heinrich, Charles Curtis Lindner, Christopher A. Rodger

J. Comb. Theory A, 1988

1987

Exact coverings of 2-paths by 4-cycles.

Katherine Heinrich, Gillian M. Nonay

J. Comb. Theory A, 1987

On the problem of bandsize.

Katherine Heinrich, Pavol Hell

Graphs Comb., 1987

1986

Existence of orthogonal latin squares with aligned subsquares.

Katherine Heinrich, Lie Zhu

Discret. Math., 1986

1983

Partitioning oriented 2-paths.

Katherine Heinrich

J. Graph Theory, 1983

Doubly diagonal orthogonal latin squares.

Katherine Heinrich, Anthony J. W. Hilton

Discret. Math., 1983

1980

Latin Squares with No Proper Subsquares.

Katherine Heinrich

J. Comb. Theory A, 1980

1978

Graphs with symmetric automorphism group.

Walter D. Wallis, Katherine Heinrich

J. Graph Theory, 1978