Donald L. Kreher

Orcid: 0000-0002-5031-9410

According to our database1, Donald L. Kreher authored at least 37 papers between 1983 and 2024.

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

2024
Constructions and Bounds for Codes With Restricted Overlaps.
IEEE Trans. Inf. Theory, April, 2024

2020
Block-avoiding point sequencings of Mendelsohn triple systems.
Discret. Math., 2020

Block-avoiding point sequencings of directed triple systems.
Discret. Math., 2020

Uniformly resolvable decompositions of K<sub>v</sub> in 1-factors and 4-stars.
Australas. J Comb., 2020

2019
On factor-invariant graphs.
Discret. Math., 2019

Nonsequenceable Steiner triple systems.
Bull. ICA, 2019

Block-avoiding sequencings of points in Steiner triple systems.
Australas. J Comb., 2019

2018
Some new Kirkman signal sets.
Des. Codes Cryptogr., 2018

Corrigendum to: A note on nearly platonic graphs.
Australas. J Comb., 2018

A note on nearly platonic graphs.
Australas. J Comb., 2018

2017
The Friedlander-Gordon-Miller conjecture is true.
Australas. J Comb., 2017

2015
A note on the cyclic matching sequencibility of graphs.
Australas. J Comb., 2015

2014
On Reconstructing Graphs and Their Complements.
SIAM J. Discret. Math., 2014

f-vectors of pure complexes and pure multicomplexes of rank three.
Discret. Math., 2014

2013
Orthogonal projection and liftings of Hamilton-decomposable Cayley graphs on abelian groups.
Discret. Math., 2013

2009
6-regular Cayley graphs on abelian groups of odd order are hamiltonian decomposable.
Discret. Math., 2009

On orthogonal generalized equitable rectangles.
Des. Codes Cryptogr., 2009

2008
Small Group Divisible Steiner Quadruple Systems.
Electron. J. Comb., 2008

2005
Graphs, algorithms and optimization.
Chapman&Hall/CRC Press, ISBN: 978-1-58488-396-8, 2005

2004
Tight incomplete block designs.
Discret. Math., 2004

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

2003
A note on {4}-GDDs of type 2<sup>10</sup>.
Discret. Math., 2003

1999
Combinatorial algorithms: generation, enumeration, and search.
SIGACT News, 1999

Covering Arrays of Strength Three.
Des. Codes Cryptogr., 1999

1996
A family of resolvable regular graph designs.
Discret. Math., 1996

Concerning Difference Matrices.
Des. Codes Cryptogr., 1996

1995
Partial Steiner Triple Systems with Equal-Sized Holes.
J. Comb. Theory A, 1995

A note on spanning trees in near d-angulations.
Ars Comb., 1995

The intersection problem for small G-designs.
Australas. J Comb., 1995

1993
The parameters 4-(12, 6, 6) and related t-designs.
Australas. J Comb., 1993

1991
On the covering of t-sets with (t + 1)-sets: C(9, 5, 4) and C(10, 6, 5).
Discret. Math., 1991

1990
Large sets of disjoint t-designs.
Australas. J Comb., 1990

1989
A generalization of Connor's inequality to <i>t</i>-designs with automorphisms.
J. Comb. Theory A, 1989

1988
Search algorithm for Ramsey graphs by union of group orbits.
J. Graph Theory, 1988

1986
The existence of simple 6-(14, 7, 4) designs.
J. Comb. Theory A, 1986

An incidence algebra for <i>t</i>-designs with automorphisms.
J. Comb. Theory A, 1986

1983
Graphical t-wise balanced designs.
Discret. Math., 1983


  Loading...