default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElizabeth J. Billington
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2012
[j47]Elizabeth J. Billington, Nicholas J. Cavenagh, Abdollah Khodkar:
Complete sets of metamorphoses: Twofold 4-cycle systems into twofold 6-cycle systems. Discret. Math. 312(16): 2438-2445 (2012)- 2011
- [j46]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) - [j45]Elizabeth J. Billington:
5-cycle decompositions from paired 3- and 4-cycle decompositions. Australas. J Comb. 51: 109-114 (2011) - [j44]Elizabeth J. Billington, Diane M. Donovan, James G. Lefevre, Thomas A. McCourt, Charles C. Lindner:
The triangle intersection problem for nested Steiner triple systems. Australas. J Comb. 51: 221-234 (2011) - [j43]Elizabeth J. Billington, Dean G. Hoffman:
Lambda-fold 2-perfect 6-cycle systems in equipartite graphs. Discret. Math. 311(21): 2423-2427 (2011) - [j42]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
- [j41]Peter Adams, Elizabeth J. Billington, Dean G. Hoffman, Charles Curtis Lindner:
The generalized almost resolvable cycle system problem. Comb. 30(6): 617-625 (2010) - [j40]Elizabeth J. Billington, Nicholas J. Cavenagh, Benjamin R. Smith:
Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts. Discret. Math. 310(2): 241-254 (2010) - 2009
- [j39]Elizabeth J. Billington, Nicholas J. Cavenagh, Benjamin R. Smith:
Path and cycle decompositions of complete equipartite graphs: Four parts. Discret. Math. 309(10): 3061-3073 (2009) - [j38]Elizabeth J. Billington, Charles Curtis Lindner:
Embedding 5-cycle systems into pentagon triple systems. Discret. Math. 309(14): 4828-4834 (2009) - 2008
- [j37]Elizabeth J. Billington, Christopher A. Rodger:
Resolvable 4-cycle group divisible designs with two associate classes: Part size even. Discret. Math. 308(2-3): 303-307 (2008) - [j36]Elizabeth J. Billington, Dean G. Hoffman:
Equipartite and almost-equipartite gregarious 4-cycle systems. Discret. Math. 308(5-6): 696-714 (2008) - [j35]Elizabeth J. Billington, Dean G. Hoffman, Christopher A. Rodger:
Resolvable gregarious cycle decompositions of complete equipartite graphs. Discret. Math. 308(13): 2844-2853 (2008) - [j34]Elizabeth J. Billington, Nicholas J. Cavenagh:
Sparse Graphs which Decompose into Closed Trails of Arbitrary Lengths. Graphs Comb. 24(3): 129-147 (2008) - 2007
- [j33]Elizabeth J. Billington, Benjamin R. Smith, Dean G. Hoffman:
Equipartite gregarious 6- and 8-cycle systems. Discret. Math. 307(13): 1659-1667 (2007) - 2005
- [j32]Elizabeth J. Billington, Charles C. Lindner, Alexander Rosa:
Lambda-fold complete graph decompositions into perfect four-triple configurations. Australas. J Comb. 32: 323-330 (2005) - [j31]Elizabeth J. Billington, Hung-Lin Fu, Christopher A. Rodger:
Packing lambda-Fold Complete Multipartite Graphs with 4-Cycles. Graphs Comb. 21(2): 169-186 (2005) - 2004
- [j30]Elizabeth J. Billington:
The extended metamorphosis of a complete bipartite design into a cycle system. Discret. Math. 284(1-3): 63-70 (2004) - 2003
- [j29]Elizabeth J. Billington, Dean G. Hoffman:
Decomposition of complete tripartite graphs into gregarious 4-cycles. Discret. Math. 261(1-3): 87-111 (2003) - 2002
- [j28]Elizabeth J. Billington, Gaetano Quattrocchi:
The metamorphosis of lambda-fold K3, 3-designs into lambda-fold 6-cycle systems. Ars Comb. 64: 65- (2002) - [j27]Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Ebadollah S. Mahmoodian:
The three-way intersection problem for latin squares. Discret. Math. 243(1-3): 1-19 (2002) - [j26]Elizabeth J. Billington, Dean G. Hoffman:
Trade spectra of complete partite graphs. Discret. Math. 250(1-3): 23-39 (2002) - [j25]Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Saad I. El-Zanati:
On the Hamilton-Waterloo Problem. Graphs Comb. 18(1): 31-51 (2002) - 2001
- [j24]Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Abdollah Khodkar:
The mu-way intersection problem for m-cycle systems. Discret. Math. 231(1-3): 27-56 (2001) - [j23]Elizabeth J. Billington, Dean G. Hoffman:
Trades and Graphs. Graphs Comb. 17(1): 39-54 (2001) - 2000
- [j22]Nicholas J. Cavenagh, Elizabeth J. Billington:
On decomposing complete tripartite graphs into 5-cycles. Australas. J Comb. 22: 41-62 (2000) - [j21]Elizabeth J. Billington:
The metamorphosis of lambda-fold 4-wheel systems into lambda-fold bowtie systems. Australas. J Comb. 22: 265-286 (2000) - [j20]Peter Adams, Elizabeth J. Billington, Italo J. Dejter, Charles Curtis Lindner:
The number of 4-cycles in 2-factorizations of K2n minus a 1-factor. Discret. Math. 220(1-3): 1-11 (2000) - [j19]Nicholas J. Cavenagh, Elizabeth J. Billington:
Decompositions of Complete Multipartite Graphs into Cycles of Even Length. Graphs Comb. 16(1): 49-65 (2000) - 1999
- [j18]Elizabeth J. Billington, Darryn E. Bryant:
The possible number of cycles in cycle systems. Ars Comb. 52 (1999) - [j17]Elizabeth J. Billington:
Decomposing complete tripartite graphs into cycles of lengths 3 and 4. Discret. Math. 197-198: 123-135 (1999) - 1998
- [j16]Elizabeth J. Billington, David A. Pike:
Decomposing block-intersection graphs of Steiner triple systems into triangles. Australas. J Comb. 18: 51-64 (1998) - [j15]Elizabeth J. Billington, Giovanni Lo Faro:
Repeated blocks in indecomposable twofold extended triple systems. Australas. J Comb. 18: 209-218 (1998) - [j14]Elizabeth J. Billington, Dean G. Hoffman:
The intersection problem for star designs. Discret. Math. 179(1-3): 217-222 (1998) - 1996
- [j13]Peter Adams, Elizabeth J. Billington:
Lambda-fold 3-perfect 9-cycle systems. Ars Comb. 44 (1996) - [j12]Peter Adams, Elizabeth J. Billington, Darryn E. Bryant:
Partitionable perfect cycle systems with cycle lengths 6 and 8. Discret. Math. 149(1-3): 1-9 (1996) - 1995
- [j11]Elizabeth J. Billington, Donald L. Kreher:
The intersection problem for small G-designs. Australas. J Comb. 12: 239-258 (1995) - 1994
- [j10]Elizabeth J. Billington, Charles Curtis Lindner:
The spectrum for 2-perfect bowtie systems. Discret. Math. 135(1-3): 61-68 (1994) - 1993
- [j9]Peter Adams, Elizabeth J. Billington:
Completing some spectra for 2-perfect cycle systems. Australas. J Comb. 7: 175-188 (1993) - [j8]Peter Adams, Elizabeth J. Billington, Charles C. Lindner:
Corrigendum: The spectrum for 3-perfect 9-cycle systems. Australas. J Comb. 8: 277-278 (1993) - [j7]Elizabeth J. Billington, Ebadollah S. Mahmoodian:
Multi-Set designs and numbers of common triples. Graphs Comb. 9(2-4): 105-115 (1993) - 1992
- [j6]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) - [j5]Peter Adams, Elizabeth J. Billington, Charles C. Lindner:
The spectrum for 3-perfect 9-cycle systems. Australas. J Comb. 5: 103-108 (1992) - [j4]Elizabeth J. Billington, Charles C. Lindner:
The spectrum for lambda-fold 2-perfect 6-cycle systems. Eur. J. Comb. 13(1): 5-14 (1992) - 1991
- [j3]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) - 1989
- [j2]Elizabeth J. Billington:
New cyclic (61, 244, 40, 10, 6) BIBDs. Discret. Math. 77(1-3): 51-53 (1989) - 1982
- [j1]Elizabeth J. Billington:
More balanced ternary designs with block size three. Discret. Math. 39(1): 9-21 (1982)
Coauthor Index
aka: D. G. Hoffman
aka: Charles Curtis Lindner
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-04-25 05:58 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:
