Dean G. Hoffman

According to our database, Dean G. Hoffman authored at least 64 papers between 1981 and 2024.

Collaborative distances:

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

2024

Color trades on n-cubes and complete bipartite graphs.

John Carr, Dean Hoffman

Discret. Math., 2024

2023

Self-colorings of graphs.

Joseph Briggs, Dean Hoffman, Sarah Heuss Holliday, Peter D. Johnson Jr.

Bull. ICA, 2023

2019

On Rainbow-Cycle-Forbidding Edge Colorings of Finite Graphs.

Dean Hoffman, Paul Horn, Peter D. Johnson Jr., Andrew Owens

Graphs Comb., 2019

2017

Factor pair latin squares.

James M. Hammer, Dean Hoffman

Australas. J Comb., 2017

2015

Hall's theorem and extending partial latinized rectangles.

John L. Goldwasser, Anthony J. W. Hilton, Dean G. Hoffman, Sibel Özkan

J. Comb. Theory A, 2015

2014

Maximum packings of K_n with k-stars.

D. G. Hoffman, Dan Roberts

Australas. J Comb., 2014

2013

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

Dean G. Hoffman, Sarah H. Holliday

Ars Comb., 2013

2011

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

Elizabeth J. Billington, Italo J. Dejter, Dean G. Hoffman, Charles Curtis Lindner

Graphs Comb., 2011

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

Elizabeth J. Billington, Dean G. Hoffman

Discret. Math., 2011

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

Elizabeth J. Billington, Dean G. Hoffman, Charles C. Lindner, Mariusz Meszka

Australas. J Comb., 2011

2010

The generalized almost resolvable cycle system problem.

Peter Adams, Elizabeth J. Billington, Dean G. Hoffman, Charles Curtis Lindner

Comb., 2010

2009

On the spectrum of minimal covers by triples.

Vincent E. Castellana, D. G. Hoffman

Australas. J Comb., 2009

2008

Resolvable gregarious cycle decompositions of complete equipartite graphs.

Elizabeth J. Billington, Dean G. Hoffman, Christopher A. Rodger

Discret. Math., 2008

Equipartite and almost-equipartite gregarious 4-cycle systems.

Elizabeth J. Billington, Dean G. Hoffman

Discret. Math., 2008

2007

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

Dean G. Hoffman, Peter D. Johnson Jr.

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

Equipartite gregarious 6- and 8-cycle systems.

Elizabeth J. Billington, Benjamin R. Smith, Dean G. Hoffman

Discret. Math., 2007

2006

Signed graph factors and degree sequences.

Dean Hoffman, Heather Jordon

J. Graph Theory, 2006

Bipartite graphs with even spanning trees.

Dean G. Hoffman, Matt Walsh

Australas. J Comb., 2006

2005

Generating Huffman sequences.

Dean Hoffman, Peter D. Johnson Jr., Nadine Wilson

J. Algorithms, 2005

2004

Preface.

Christopher A. Rodger, Dean G. Hoffman

Discret. Math., 2004

The real truth about star designs.

Dean G. Hoffman

Discret. Math., 2004

A partial K₄-e-design of order n can be embedded in a K₄-e-design of order at most 8n+16√n+82.

D. G. Hoffman, Charles C. Lindner

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>.

Dean G. Hoffman, Charles Curtis Lindner, Christopher A. Rodger

Discret. Math., 2003

Decomposition of complete tripartite graphs into gregarious 4-cycles.

Elizabeth J. Billington, Dean G. Hoffman

Discret. Math., 2003

2002

Trade spectra of complete partite graphs.

Elizabeth J. Billington, Dean G. Hoffman

Discret. Math., 2002

2001

Star Decompositions of Cubes.

Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden, Dean G. Hoffman

Graphs Comb., 2001

Trades and Graphs.

Elizabeth J. Billington, Dean G. Hoffman

Graphs Comb., 2001

2000

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

Matthew M. Cropper, John L. Goldwasser, Anthony J. W. Hilton, Dean G. Hoffman, Peter D. Johnson Jr.

J. Graph Theory, 2000

alpha-Domination.

Jean E. Dunbar, Dean G. Hoffman, Renu C. Laskar, Lisa R. Markus

Discret. Math., 2000

1999

Another Doyen-Wilson Theorem.

Dean G. Hoffman, Kimberly S. Kirkpatrick

Ars Comb., 1999

1998

The intersection problem for star designs.

Elizabeth J. Billington, Dean G. Hoffman

Discret. Math., 1998

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

Abdollah Khodkar, Dean G. Hoffman

Australas. J Comb., 1998

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

Dean G. Hoffman, Kimberly S. Kirkpatrick

Australas. J Comb., 1998

1997

Critical sets in a family of groups.

Diane M. Donovan, D. G. Hoffman

Australas. J Comb., 1997

1996

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

Dean G. Hoffman, C. A. Rodger

Discret. Math., 1996

5-Cycle Systems with Holes.

Darryn E. Bryant, Dean G. Hoffman, Christopher A. Rodger

Des. Codes Cryptogr., 1996

Thwart numbers of some bipartite graphs.

Dean G. Hoffman, Peter D. Johnson Jr., Evan B. Wantland

Australas. J Comb., 1996

1995

Cores of class II graphs.

D. G. Hoffman

J. Graph Theory, 1995

Near subgroups of groups.

D. G. Hoffman, Sylvia A. Hobart, Ronald C. Mullin

Discret. Math., 1995

Digraphs of finite linear transformations.

D. G. Hoffman

Australas. J Comb., 1995

1993

Maximal Sets of 2-Factors and Hamiltonian Cycles.

Dean G. Hoffman, Christopher A. Rodger, Alexander Rosa

J. Comb. Theory B, 1993

A Note on a Conjecture Concerning Symmetric Resilient Functions.

K. Gopalakrishnan, Dean G. Hoffman, Douglas R. Stinson

Inf. Process. Lett., 1993

Linear codes and weights.

D. G. Hoffman

Australas. J Comb., 1993

1992

The chromatic index of complete multipartite graphs.

Dean G. Hoffman, Christopher A. Rodger

J. Graph Theory, 1992

Directed star decompositions of the complete directed graph.

Charles J. Colbourn, Dean G. Hoffman, C. A. Rodger

J. Graph Theory, 1992

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

Charles J. Colbourn, Dean G. Hoffman, Rolf S. Rees

J. Comb. Theory A, 1992

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

Elizabeth J. Billington, D. G. Hoffman

Australas. J Comb., 1992

1991

The existence of C_k-factorizations of K_2n-F.

Dean G. Hoffman, Paul J. Schellenberg

Discret. Math., 1991

Blocking sets in designs with block size four II.

Dean G. Hoffman, Charles C. Lindner, Kevin T. Phelps

Discret. Math., 1991

Directed star decompositions of directed multigraphs.

Charles J. Colbourn, Dean G. Hoffman, C. A. Rodger

Discret. Math., 1991

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

Elizabeth J. Billington, Dean G. Hoffman

Discret. Math., 1991

The number of t-wise balance designs.

Charles J. Colbourn, Dean G. Hoffman, Kevin T. Phelps, Vojtech Rödl, Peter Winkler

Comb., 1991

1990

Blocking Sets in Designs with Block Size 4.

Dean G. Hoffman, Charles C. Lindner, Kevin T. Phelps

Eur. J. Comb., 1990

1989

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

Dominique de Caen, D. G. Hoffman

SIAM J. Discret. Math., 1989

On the construction of odd cycle systems.

Dean G. Hoffman, Charles Curtis Lindner, Christopher A. Rodger

J. Graph Theory, 1989

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

Amanda G. Chetwynd, Anthony J. W. Hilton, Dean G. Hoffman

J. Comb. Theory B, 1989

1988

Class one graphs.

Dean G. Hoffman, Christopher A. Rodger

J. Comb. Theory B, 1988

1987

Bidegreed graphs are edge reconstructible.

Wendy J. Myrvold, Mark N. Ellingham, D. G. Hoffman

J. Graph Theory, 1987

Steiner Triple Systems with an Involution.

Alan Hartman, Dean G. Hoffman

Eur. J. Comb., 1987

1986

The number of repeated blocks in twofold triple systems.

Alexander Rosa, Dean G. Hoffman

J. Comb. Theory A, 1986

1983

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

Dean G. Hoffman

J. Comb. Theory A, 1983

Completing Incomplete Commutative Latin Squares With Prescribed Diagonals.

Dean G. Hoffman

Eur. J. Comb., 1983

1982

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

Dean G. Hoffman, Charles C. Lindner

Eur. J. Comb., 1982

1981

On a probabilistic method in graph theory.

D. L. Greenwell, D. G. Hoffman

J. Comb. Theory B, 1981