# Dean G. Hoffman

According to our database

Collaborative distances:

^{1}, Dean G. Hoffman authored at least 61 papers between 1981 and 2017.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2017

Factor pair latin squares.

Australasian J. Combinatorics, 2017

2015

Hall's theorem and extending partial latinized rectangles.

J. Comb. Theory, Ser. A, 2015

2014

Maximum packings of K

_{n}with k-stars.
Australasian J. Combinatorics, 2014

2013

Resolvably Decomposing Complete Equipartite Graphs Minus a One-Factor into Cycles of Uniform Even Length.

Ars Comb., 2013

2011

Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles.

Graphs and Combinatorics, 2011

Lambda-fold 2-perfect 6-cycle systems in equipartite graphs.

Discrete Mathematics, 2011

Almost resolvable minimum coverings of complete graphs with 4-cycles.

Australasian J. Combinatorics, 2011

2010

The generalized almost resolvable cycle system problem.

Combinatorica, 2010

2009

On the spectrum of minimal covers by triples.

Australasian J. Combinatorics, 2009

2008

Resolvable gregarious cycle decompositions of complete equipartite graphs.

Discrete Mathematics, 2008

Equipartite and almost-equipartite gregarious 4-cycle systems.

Discrete Mathematics, 2008

2007

Extending Hall's Theorem into List Colorings: A Partial History.

Int. J. Math. Mathematical Sciences, 2007

Equipartite gregarious 6- and 8-cycle systems.

Discrete Mathematics, 2007

2006

Signed graph factors and degree sequences.

Journal of Graph Theory, 2006

Bipartite graphs with even spanning trees.

Australasian J. Combinatorics, 2006

2005

Generating Huffman sequences.

J. Algorithms, 2005

2004

Preface.

Discrete Mathematics, 2004

The real truth about star designs.

Discrete Mathematics, 2004

A partial K

_{4}-e-design of order n can be embedded in a K_{4}-e-design of order at most 8n+16√n+82.
Australasian J. Combinatorics, 2004

2003

A partial 2

*k*-cycle system of order*n*can be embedded in a 2*k*-cycle system of order*kn*+*c(k)*,*k*geq3, where*c(k)*is a quadratic function of*k*.
Discrete Mathematics, 2003

Decomposition of complete tripartite graphs into gregarious 4-cycles.

Discrete Mathematics, 2003

2002

Trade spectra of complete partite graphs.

Discrete Mathematics, 2002

2001

Star Decompositions of Cubes.

Graphs and Combinatorics, 2001

Trades and Graphs.

Graphs and Combinatorics, 2001

2000

Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs.

Journal of Graph Theory, 2000

alpha-Domination.

Discrete Mathematics, 2000

1999

Another Doyen-Wilson Theorem.

Ars Comb., 1999

1998

The intersection problem for star designs.

Discrete Mathematics, 1998

On the non-existence of Steiner (v, k, 2) trades with certain volumes.

Australasian J. Combinatorics, 1998

G-designs of order n and index λ where G has 5 vertices or less.

Australasian J. Combinatorics, 1998

1997

Critical sets in a family of groups.

Australasian J. Combinatorics, 1997

1996

On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs.

Discrete Mathematics, 1996

5-Cycle Systems with Holes.

Des. Codes Cryptography, 1996

Thwart numbers of some bipartite graphs.

Australasian J. Combinatorics, 1996

1995

Cores of class II graphs.

Journal of Graph Theory, 1995

Near subgroups of groups.

Discrete Mathematics, 1995

Digraphs of finite linear transformations.

Australasian J. Combinatorics, 1995

1993

Maximal Sets of 2-Factors and Hamiltonian Cycles.

J. Comb. Theory, Ser. B, 1993

A Note on a Conjecture Concerning Symmetric Resilient Functions.

Inf. Process. Lett., 1993

Linear codes and weights.

Australasian J. Combinatorics, 1993

1992

The chromatic index of complete multipartite graphs.

Journal of Graph Theory, 1992

Directed star decompositions of the complete directed graph.

Journal of Graph Theory, 1992

A New Class of Group Divisible Designs with Block Size Three.

J. Comb. Theory, Ser. A, 1992

Pairs of simple balanced ternary designs with prescribed numbers of triples in common.

Australasian J. Combinatorics, 1992

1991

Discrete Mathematics, 1991

Blocking sets in designs with block size four II.

Discrete Mathematics, 1991

Directed star decompositions of directed multigraphs.

Discrete Mathematics, 1991

The number of repeated blocks in balanced ternary designs with block size three II.

Discrete Mathematics, 1991

The number of t-wise balance designs.

Combinatorica, 1991

1990

Blocking Sets in Designs with Block Size 4.

Eur. J. Comb., 1990

1989

Impossibility of Decomposing the Complete Graph on n Points into n-1 Isomorphic Complete Bipartite Graphs.

SIAM J. Discrete Math., 1989

On the construction of odd cycle systems.

Journal of Graph Theory, 1989

On the Delta-subgraph of graphs which are critical with respect to the chromatic index.

J. Comb. Theory, Ser. B, 1989

1988

Class one graphs.

J. Comb. Theory, Ser. B, 1988

1987

Bidegreed graphs are edge reconstructible.

Journal of Graph Theory, 1987

Steiner Triple Systems with an Involution.

Eur. J. Comb., 1987

1986

The number of repeated blocks in twofold triple systems.

J. Comb. Theory, Ser. A, 1986

1983

On the Spectrum of n Quasigroups with Given Conjugate Invariant Subgroup.

J. Comb. Theory, Ser. A, 1983

Completing Incomplete Commutative Latin Squares With Prescribed Diagonals.

Eur. J. Comb., 1983

1982

Mendelsohn Triple Systems Having a Prescribed Number of Triples in Common.

Eur. J. Comb., 1982

1981

On a probabilistic method in graph theory.

J. Comb. Theory, Ser. B, 1981