# Dean G. Hoffman

Affiliations:- Auburn University, Department of Mathematics and Statistics, AL, USA

According to our database

Collaborative distances:

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

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2024

Discret. Math., 2024

2023

Bull. ICA, 2023

2019

Graphs Comb., 2019

2017

Australas. J Comb., 2017

2015

J. Comb. Theory A, 2015

2014

Australas. J Comb., 2014

2013

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

Ars Comb., 2013

2011

Graphs Comb., 2011

Discret. Math., 2011

Australas. J Comb., 2011

2010

Comb., 2010

2009

Australas. J Comb., 2009

2008

Discret. Math., 2008

Discret. Math., 2008

2007

Int. J. Math. Math. Sci., 2007

Discret. Math., 2007

2006

J. Graph Theory, 2006

Australas. J Comb., 2006

2005

J. Algorithms, 2005

2004

Discret. Math., 2004

Discret. Math., 2004

A partial K<sub>4</sub>-e-design of order n can be embedded in a K<sub>4</sub>-e-design of order at most 8n+16√n+82.

Australas. J Comb., 2004

2003

A partial 2<i>k</i>-cycle system of order <i>n</i> can be embedded in a 2<i>k</i>-cycle system of order <i>kn</i>+<i>c(k)</i>, <i>k</i>geq3, where <i>c(k)</i> is a quadratic function of <i>k</i>.

Discret. Math., 2003

Discret. Math., 2003

2002

Discret. Math., 2002

2001

Graphs Comb., 2001

Graphs Comb., 2001

2000

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

J. Graph Theory, 2000

Discret. Math., 2000

1999

Another Doyen-Wilson Theorem.

Ars Comb., 1999

1998

Discret. Math., 1998

Australas. J Comb., 1998

Australas. J Comb., 1998

1997

Critical sets in a family of groups.

Australas. J Comb., 1997

1996

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

Discret. Math., 1996

Des. Codes Cryptogr., 1996

Australas. J Comb., 1996

1995

J. Graph Theory, 1995

Discret. Math., 1995

Australas. J Comb., 1995

1993

J. Comb. Theory B, 1993

Inf. Process. Lett., 1993

Australas. J Comb., 1993

1992

J. Graph Theory, 1992

J. Graph Theory, 1992

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

J. Comb. Theory A, 1992

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

Australas. J Comb., 1992

1991

Discret. Math., 1991

Discret. Math., 1991

Discret. Math., 1991

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

Discret. Math., 1991

Comb., 1991

1990

Eur. J. Comb., 1990

1989

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

SIAM J. Discret. Math., 1989

J. Graph Theory, 1989

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

J. Comb. Theory B, 1989

1988

J. Comb. Theory B, 1988

1987

J. Graph Theory, 1987

Eur. J. Comb., 1987

1986

J. Comb. Theory A, 1986

1983

J. Comb. Theory A, 1983

Eur. J. Comb., 1983

1982

Eur. J. Comb., 1982

1981

J. Comb. Theory B, 1981