default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDean G. Hoffman
Person information
- affiliation: Auburn University, Department of Mathematics and Statistics, AL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j64]John Carr
, Dean Hoffman:
Color trades on n-cubes and complete bipartite graphs. Discret. Math. 347(10): 114099 (2024)- 2023
- [j63]Joseph Briggs, Dean Hoffman, Sarah Heuss Holliday, Peter D. Johnson Jr.:
Self-colorings of graphs. Bull. ICA 97: 106-116 (2023) - 2019
- [j62]Dean Hoffman, Paul Horn, Peter D. Johnson Jr., Andrew Owens:
On Rainbow-Cycle-Forbidding Edge Colorings of Finite Graphs. Graphs Comb. 35(6): 1585-1596 (2019) - 2017
- [j61]James M. Hammer, Dean Hoffman:
Factor pair latin squares. Australas. J Comb. 69: 41-57 (2017) - 2015
- [j60]John L. Goldwasser, Anthony J. W. Hilton, Dean G. Hoffman, Sibel Özkan:
Hall's theorem and extending partial latinized rectangles. J. Comb. Theory A 130: 26-41 (2015) - 2014
- [j59]D. G. Hoffman, Dan Roberts:
Maximum packings of Kn with k-stars. Australas. J Comb. 59: 206-210 (2014) - 2013
- [j58]Dean G. Hoffman, Sarah H. Holliday:
Resolvably Decomposing Complete Equipartite Graphs Minus a One-Factor into Cycles of Uniform Even Length. Ars Comb. 110: 435-445 (2013) - 2011
- [j57]Elizabeth J. Billington, Dean G. Hoffman, Charles C. Lindner, Mariusz Meszka:
Almost resolvable minimum coverings of complete graphs with 4-cycles. Australas. J Comb. 50: 73-86 (2011) - [j56]Elizabeth J. Billington, Dean G. Hoffman:
Lambda-fold 2-perfect 6-cycle systems in equipartite graphs. Discret. Math. 311(21): 2423-2427 (2011) - [j55]Elizabeth J. Billington, Italo J. Dejter, Dean G. Hoffman, Charles Curtis Lindner:
Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles. Graphs Comb. 27(2): 161-170 (2011) - 2010
- [j54]Peter Adams, Elizabeth J. Billington, Dean G. Hoffman, Charles Curtis Lindner:
The generalized almost resolvable cycle system problem. Comb. 30(6): 617-625 (2010) - 2009
- [j53]Vincent E. Castellana, D. G. Hoffman:
On the spectrum of minimal covers by triples. Australas. J Comb. 45: 43-58 (2009) - 2008
- [j52]Elizabeth J. Billington, Dean G. Hoffman:
Equipartite and almost-equipartite gregarious 4-cycle systems. Discret. Math. 308(5-6): 696-714 (2008) - [j51]Elizabeth J. Billington, Dean G. Hoffman, Christopher A. Rodger:
Resolvable gregarious cycle decompositions of complete equipartite graphs. Discret. Math. 308(13): 2844-2853 (2008) - 2007
- [j50]Elizabeth J. Billington, Benjamin R. Smith, Dean G. Hoffman:
Equipartite gregarious 6- and 8-cycle systems. Discret. Math. 307(13): 1659-1667 (2007) - [j49]Dean G. Hoffman, Peter D. Johnson Jr.:
Extending Hall's Theorem into List Colorings: A Partial History. Int. J. Math. Math. Sci. 2007: 72168:1-72168:17 (2007) - 2006
- [j48]Dean G. Hoffman, Matt Walsh:
Bipartite graphs with even spanning trees. Australas. J Comb. 35: 3-6 (2006) - [j47]Dean Hoffman, Heather Jordon:
Signed graph factors and degree sequences. J. Graph Theory 52(1): 27-36 (2006) - 2005
- [j46]Dean Hoffman, Peter D. Johnson Jr., Nadine Wilson:
Generating Huffman sequences. J. Algorithms 54(1): 115-121 (2005) - 2004
- [j45]D. G. Hoffman, Charles C. Lindner:
A partial K4-e-design of order n can be embedded in a K4-e-design of order at most 8n+16√n+82. Australas. J Comb. 29: 225-230 (2004) - [j44]Christopher A. Rodger, Dean G. Hoffman:
Preface. Discret. Math. 284(1-3): 1-7 (2004) - [j43]Dean G. Hoffman:
The real truth about star designs. Discret. Math. 284(1-3): 177-180 (2004) - 2003
- [j42]Elizabeth J. Billington, Dean G. Hoffman:
Decomposition of complete tripartite graphs into gregarious 4-cycles. Discret. Math. 261(1-3): 87-111 (2003) - [j41]Dean G. Hoffman, Charles Curtis Lindner, Christopher A. Rodger:
A partial 2k-cycle system of order n can be embedded in a 2k-cycle system of order kn+c(k), kgeq3, where c(k) is a quadratic function of k. Discret. Math. 261(1-3): 325-336 (2003) - 2002
- [j40]Elizabeth J. Billington, Dean G. Hoffman:
Trade spectra of complete partite graphs. Discret. Math. 250(1-3): 23-39 (2002) - 2001
- [j39]Elizabeth J. Billington, Dean G. Hoffman:
Trades and Graphs. Graphs Comb. 17(1): 39-54 (2001) - [j38]Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden, Dean G. Hoffman:
Star Decompositions of Cubes. Graphs Comb. 17(1): 55-59 (2001) - 2000
- [j37]Jean E. Dunbar, Dean G. Hoffman, Renu C. Laskar, Lisa R. Markus:
alpha-Domination. Discret. Math. 211: 11-26 (2000) - [j36]Matthew M. Cropper, John L. Goldwasser, Anthony J. W. Hilton, Dean G. Hoffman, Peter D. Johnson Jr.:
Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs. J. Graph Theory 33(4): 199-219 (2000) - 1999
- [j35]Dean G. Hoffman, Kimberly S. Kirkpatrick:
Another Doyen-Wilson Theorem. Ars Comb. 54 (1999) - 1998
- [j34]Dean G. Hoffman, Kimberly S. Kirkpatrick:
G-designs of order n and index λ where G has 5 vertices or less. Australas. J Comb. 18: 13-38 (1998) - [j33]Abdollah Khodkar, Dean G. Hoffman:
On the non-existence of Steiner (v, k, 2) trades with certain volumes. Australas. J Comb. 18: 303-312 (1998) - [j32]Elizabeth J. Billington, Dean G. Hoffman:
The intersection problem for star designs. Discret. Math. 179(1-3): 217-222 (1998) - 1997
- [j31]Diane M. Donovan, D. G. Hoffman:
Critical sets in a family of groups. Australas. J Comb. 16: 21-28 (1997) - 1996
- [j30]Dean G. Hoffman, Peter D. Johnson Jr., Evan B. Wantland:
Thwart numbers of some bipartite graphs. Australas. J Comb. 13: 247-258 (1996) - [j29]Darryn E. Bryant, Dean G. Hoffman, Christopher A. Rodger:
5-Cycle Systems with Holes. Des. Codes Cryptogr. 8(1-2): 103-108 (1996) - [j28]Dean G. Hoffman, C. A. Rodger:
On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs. Discret. Math. 160(1-3): 177-187 (1996) - 1995
- [j27]D. G. Hoffman:
Digraphs of finite linear transformations. Australas. J Comb. 12: 225-238 (1995) - [j26]D. G. Hoffman, Sylvia A. Hobart, Ronald C. Mullin:
Near subgroups of groups. Discret. Math. 146(1-3): 97-108 (1995) - [j25]D. G. Hoffman:
Cores of class II graphs. J. Graph Theory 20(3): 397-402 (1995) - 1993
- [j24]D. G. Hoffman:
Linear codes and weights. Australas. J Comb. 7: 37-46 (1993) - [j23]K. Gopalakrishnan, Dean G. Hoffman, Douglas R. Stinson:
A Note on a Conjecture Concerning Symmetric Resilient Functions. Inf. Process. Lett. 47(3): 139-143 (1993) - [j22]Dean G. Hoffman, Christopher A. Rodger, Alexander Rosa:
Maximal Sets of 2-Factors and Hamiltonian Cycles. J. Comb. Theory B 57(1): 69-76 (1993) - 1992
- [j21]Elizabeth J. Billington, D. G. Hoffman:
Pairs of simple balanced ternary designs with prescribed numbers of triples in common. Australas. J Comb. 5: 59-72 (1992) - [j20]Charles J. Colbourn, Dean G. Hoffman, Rolf S. Rees:
A New Class of Group Divisible Designs with Block Size Three. J. Comb. Theory A 59(1): 73-89 (1992) - [j19]Dean G. Hoffman, Christopher A. Rodger:
The chromatic index of complete multipartite graphs. J. Graph Theory 16(2): 159-163 (1992) - [j18]Charles J. Colbourn, Dean G. Hoffman, C. A. Rodger:
Directed star decompositions of the complete directed graph. J. Graph Theory 16(5): 517-528 (1992) - 1991
- [j17]Charles J. Colbourn, Dean G. Hoffman, Kevin T. Phelps, Vojtech Rödl, Peter Winkler:
The number of t-wise balance designs. Comb. 11(3): 207-218 (1991) - [j16]Dean G. Hoffman, Charles C. Lindner, Kevin T. Phelps:
Blocking sets in designs with block size four II. Discret. Math. 89(3): 221-229 (1991) - [j15]Elizabeth J. Billington, Dean G. Hoffman:
The number of repeated blocks in balanced ternary designs with block size three II. Discret. Math. 92(1-3): 25-37 (1991) - [j14]Charles J. Colbourn, Dean G. Hoffman, C. A. Rodger:
Directed star decompositions of directed multigraphs. Discret. Math. 97(1-3): 139-148 (1991) - [j13]Dean G. Hoffman, Paul J. Schellenberg:
The existence of Ck-factorizations of K2n-F. Discret. Math. 97(1-3): 243-250 (1991) - 1990
- [j12]Dean G. Hoffman, Charles C. Lindner, Kevin T. Phelps:
Blocking Sets in Designs with Block Size 4. Eur. J. Comb. 11(5): 451-457 (1990) - 1989
- [j11]Amanda G. Chetwynd, Anthony J. W. Hilton, Dean G. Hoffman:
On the Delta-subgraph of graphs which are critical with respect to the chromatic index. J. Comb. Theory B 46(2): 240-245 (1989) - [j10]Dean G. Hoffman, Charles Curtis Lindner, Christopher A. Rodger:
On the construction of odd cycle systems. J. Graph Theory 13(4): 417-426 (1989) - [j9]Dominique de Caen, D. G. Hoffman:
Impossibility of Decomposing the Complete Graph on n Points into n-1 Isomorphic Complete Bipartite Graphs. SIAM J. Discret. Math. 2(1): 48-50 (1989) - 1988
- [j8]Dean G. Hoffman, Christopher A. Rodger:
Class one graphs. J. Comb. Theory B 44(3): 372-376 (1988) - 1987
- [j7]Alan Hartman, Dean G. Hoffman:
Steiner Triple Systems with an Involution. Eur. J. Comb. 8(4): 371-378 (1987) - [j6]Wendy J. Myrvold, Mark N. Ellingham, D. G. Hoffman:
Bidegreed graphs are edge reconstructible. J. Graph Theory 11(3): 281-302 (1987) - 1986
- [j5]Alexander Rosa, Dean G. Hoffman:
The number of repeated blocks in twofold triple systems. J. Comb. Theory A 41(1): 61-88 (1986) - 1983
- [j4]Dean G. Hoffman:
Completing Incomplete Commutative Latin Squares With Prescribed Diagonals. Eur. J. Comb. 4(1): 33-35 (1983) - [j3]Dean G. Hoffman:
On the Spectrum of n Quasigroups with Given Conjugate Invariant Subgroup. J. Comb. Theory A 35(1): 98-99 (1983) - 1982
- [j2]Dean G. Hoffman, Charles C. Lindner:
Mendelsohn Triple Systems Having a Prescribed Number of Triples in Common. Eur. J. Comb. 3(1): 51-61 (1982) - 1981
- [j1]D. L. Greenwell, D. G. Hoffman:
On a probabilistic method in graph theory. J. Comb. Theory B 31(3): 344-347 (1981)
Coauthor Index
aka: C. A. Rodger
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
