Dr Elizabeth Billington

Billington, Elizabeth J., Lindner, Charles C., Meszka, Mariusz and Rosa, Alexander (2013). Extra 2-perfect twofold 6-cycle systems. Recent results in designs and graphs. A tribute to Lucia Gionfriddo. (pp. 135-150) Napoli, Italy: Aracne Editrice.

Billington, E. J. (2003). Combinatorial trades: a survey of recent results. Designs 2002: Further Computational and Constructive Design Theory. (pp. 47-67) edited by W.D. Wallis. Massachusetts, USA: Kluwer Academic Press. doi: 10.1007/978-1-4613-0245-2_3

Baker, Catherine and Billington, Elizabeth J. (2015). Decomposition of complete tripartite graphs into gregarious 3-paths and 6-cycles. Journal of Combinatorial Mathematics and Combinatorial Computing, 93, 97-130.

Billington, Elizabeth J., Kucukcifci, Selda, Lindner, C. C. and Meszka, Mariusz (2014). Squashing minimum coverings of 6-cycles into minimum coverings of triples. Aequationes Mathematicae, 89 (4), 1223-1239. doi: 10.1007/s00010-014-0312-4

Billington, Elizabeth J., Khodkar, Abdollah, Petrusma, Dylan and Sutton, Matthew (2014). Lambda-fold theta graphs: Metamorphosis into 6-cycles. AKCE International Journal of Graphs and Combinatorics, 11 (1), 81-94.

Billington, Elizabeth J., Cavenagh, Nicholas J. and Khodkar, Abdollah (2012). Complete sets of metamorphoses: Twofold 4-cycle systems into twofold 6-cycle systems. Discrete Mathematics, 312 (16), 2438-2445. doi: 10.1016/j.disc.2012.04.029

Billington, Elizabeth J., Khodar, Abdollah and Lindner, C. C. (2012). Complete sets of metamorphoses: Paired stars into 4-cycles. JCMCC: Journal of Combinatorial Mathematics and Combinatorial Computing, 80, 457-466.

Billington, Elizabeth J. and Cavenagh, Nicholas J. (2011). Decomposing complete tripartite graphs into 5-cycles when the partite sets have similar size. Aequationes Mathematicae, 82 (3), 277-289. doi: 10.1007/s00010-011-0098-6

Billington, Elizabeth J. and Hoffman, D. G. (2011). Lambda-fold equipartite 2-perfect 6-cycle systems. Discrete Mathematics, 311 (21), 2423-2427. doi: 10.1016/j.disc.2011.06.026

Billington, Elizabeth J., Donovan, Diane, Lefevre, James, McCourt, Thomas and Lindner, C. C. (2011). The triangle intersection problem for nested Steiner triple systems. Australasian Journal of Combinatorics, 51, 221-233.

Billington, Elizabeth J. (2011). 5-cycle decompositions from paired 3- and 4-cycle decompositions. Australasian Journal of Combinatorics, 51, 109-113.

Billington, Elizabeth J., Lindner, C. C. and Meszka, Mariusz (2011). Twofold 2-perfect bowtie systems with an extra property. Aequationes Mathematicae, 82 (1-2), 143-153. doi: 10.1007/s00010-011-0075-0

Billington, Elizabeth J., Hoffman, D.G., Lindner, C. C. and Meszka, Mariusz (2011). Almost resolvable minimum coverings of complete graphs with 4-cycles. Australasian Journal of Combinatorics, 50, 73-85.

Billington, Elizabeth J. and Khodkar, Abdollah (2011). Twofold 2-perfect 8-cycle systems with an extra property. Journal of Combinatorial Mathematics and Combinatorial Computing, 77, 243-252.

Billington, Elizabeth J., Dejter, Italo J., Hoffman, D. G. and Lindner, C. C. (2011). Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles. Graphs and Combinatorics, 27 (2), 161-170. doi: 10.1007/s00373-010-0967-0

Billington, Elizabeth J., Cavenagh, Nicholas J. and Khodkar, Abdollah (2011). Super-simple twofold 4-cycle systems. Bulletin of the Institute of Combanatorics and its Applications, 63, 48-50.

Adams, Peter, Billington, Elizabeth J., Hoffman, D. G. and Lindner, C. C. (2010). The generalized almost resolvable cycle system problem. Combinatorica, 30 (6), 617-625. doi: 10.1007/s00493-010-2525-z

Billington, Elizabeth J., Kucukcifci, Selda, Yazici, Emine Sule and Lindner, Curt (2009). Embedding 4-cycle systems into octagon triple systems. Utilitas Mathematica, 79, 99-106.

Billington, Elizabeth J., Cavenagh, Nicholas J. and Smith, Benjamin R. (2009). Path and cycle decompositions of complete equipartite graphs: Four parts. Discrete Mathematics, 309 (10), 3061-3073. doi: 10.1016/j.disc.2008.08.009

Billington, Elizabeth J. and Lindner, C. C. (2009). Embedding 5-cycle systems into pentagon triple systems. Discrete Mathematics, 309 (14), 4828-4834. doi: 10.1016/j.disc.2008.06.035

Billington, Elizabeth J. and Cavenagh, Nicholas J. (2008). Sparse Graphs which Decompose into Closed Trails of Arbitrary Lengths. Graphs and Combinatorics, 24 (3), 129-147. doi: 10.1007/s00373-008-0783-y

Billington, Elizabeth J. and Hoffman, D. G. (2008). Equipartite and almost-equipartite gregarious 4-cycle systems. Discrete Mathematics, 308 (5-6), 696-714. doi: 10.1016/j.disc.2007.07.056

Billington, Elizabeth J. and Rodger, C. A. (2008). Resolvable 4-cycle group divisible designs with two associate classes: Part size even. Discrete Mathematics, 308 (2-3), 303-307. doi: 10.1016/j.disc.2006.11.043

Billington, Elizabeth J., Donovan, Diane M. and Smith, Nicole (2008). Packing a complete graph of order 5 (mod 6) with triangles: a new method. Bulletin of the Institute of Combinatorics and its Applications, 53, 77-81.

Billington, Elizabeth J. and Wallis, W. D. (2008). A golf schedule for 24 players. Bulletin of the Institute of Combinatorics and its Applications, 52, 109-110.

Billington, Elizabeth J., Hoffman, D. G. and Rodger, C. A. (2008). Resolvable gregarious cycle decompositions of complete equipartite graphs. Discrete Mathematics, 308 (13), 2844-2853. doi: 10.1016/j.disc.2006.06.047

Billington, Elizabeth J. and Cavenagh, Nicholas J. (2007). Decomposing complete tripartite graphs into closed trails of arbitrary lengths. Czechoslovak Mathematical Journal, 57 (2), 523-551. doi: 10.1007/s10587-007-0096-y

Billington, Elizabeth J., Smith, Benjamin R. and Hoffman, D. G. (2007). Equipartite gregarious 6- and 8-cycle systems. Discrete Mathematics, 307 (13), 1659-1667. doi: 10.1016/j.disc.2006.09.016

Billington, Elizabeth J. and Hoffman, D. G. (2007). Short path decompositions of arbitrary complete multipartite graphs. Congressus Numerantium, 187, 161-173.

Billington, E. J., Yazici, E. S. and Lindner, C. C. (2007). The triangle intersection problem for K4 - e designs. Utilitas Mathematica, 73, 3-21.

Billington, E J and Lindner, C. C. (2006). Perfect triple configurations from subgraphs of K4 : the remaining cases. Bulletin of the ICA, 47, 77-90.

Billington, E. J., Lindner, C and Rosa, A. (2005). Lambda-fold complete graph decompositions into perfect four-triple configurations. Australasian Journal of Combinatorics, 32, 323-330.

Billington, E. J., Fu, H. L. and Rodger, C. A. (2005). Packing lambda-fold complete multipartite graphs with 4-cycles. Graphs And Combinatorics, 21 (2), 169-185. doi: 10.1007/s00373-004-0601-0

Billington, E. J. (2004). The extended metamorphosis of a complete bipartite design into a cycle system. Discrete Mathematics, 284 (1-3), 63-70. doi: 10.1016/j.disc.2003.11.025

Billington, Elizabeth J. (2004). Multipartite graph decomposition: cycles and closed trails. Le Matematiche, LIX (I-II), 53-72.

Elizabeth J. Billington and D. G. Hoffman (2003). Decomposition of complete tripartite graphs into gregarious 4-cycles. Discrete Mathematics, 261 (1-3), 87-111. doi: 10.1016/S0012-365X(02)00462-4

Billington, E. J. and Dancer, K. A. (2003). The metamorphosis of designs with block size four: a survey and the final case. Congressus Numerantium: a conference journal on numerical themes, 164, 129-151.

Adams, P., Billington, E. J. and Mahmoodian, E. (2003). The simultaneous metamorphosis of small-wheel systems. Journal of Combinatorial Mathematics and Combinatorial Computing, 44, 209-223.

Billington, E. J. and Quattrocchi, G. (2002). (2, C)-ordered path designs P(v, 3, 1). Journal of Combinatorial Mathematics and Combinatorial Computing, 41, 9-17.

Adams, P., Billington, E. J., Bryant, D. E. and Mahmoodian, E. S. (2002). The three-way intersection problem for latin squares. Discrete Mathematics, 243 (1-3), 1-19. doi: 10.1016/S0012-365X(00)00454-4

Billington, Elizabeth J. and Hoffman, D.G. (2002). Trade spectra of complete partite graphs. Discrete Mathematics, 250 (1-3), 23-29. doi: 10.1016/S0012-365X(01)00269-2

Billington, EJ and Quattrocchi, G (2002). The metamorphosis of lambda-fold K-3,K-3-designs into lambda-fold 6-cycle systems. Ars Combinatoria, 64, 65-80.

Adams, P., Billington, E. J., Bryant, D. E. and Mahmoodian, E. (2002). On the possible volumes of mu-way latin trades. Aequationes Mathematicae, 63 (3), 303-320. doi: 10.1007/s00010-002-8026-4

Adams, P., Billington, E. J. and Lindner, C. C. (2002). The number of 6-cycles in 2-factorizations of Kn, n odd. Journal of Combinatorial Mathematics and Combinatorial Computing, 41, 223-243.

Adams, P, Billington, EJ, Bryant, DE and El-Zanati, SI (2002). On the Hamilton-Waterloo problem. Graphs And Combinatorics, 18 (1), 31-51. doi: 10.1007/s003730200001

Billington, Elizabeth J., Fu, Hung-Lin and Rodger, C. A. (2001). Packing complete multipartite graphs with 4-cycles. Journal of Combinatorial Designs, 9 (2), 107-127. doi: 10.1002/1520-6610(2001)9:2<107::AID-JCD1002>3.0.CO;2-M

Adams, P, Billington, EJ, Bryant, DE and Khodkar, A (2001). The mu-way intersection problem for m-cycle systems. Discrete Mathematics, 231 (1-3), 27-56. doi: 10.1016/S0012-365X(00)00303-4

Billington, EJ and Lindner, CC (2001). The metamorphosis of lambda-fold 4-wheel systems into lambda-fold 4-cycle systems. Utilitas Mathematica, 59, 215-235.

Billington, E. J. and Hoffman, D. G. (2001). Trades and Graphs. Graphs and Combinatorics, 17 (1), 39-54. doi: 10.1007/PL00007238

Billington, E. J. (2000). The metamorphosis of lambda-fold 4-wheel systems into lambda-fold bowtie systems. The Australasian Journal of Combinatorics, 22, 265-286.

Cavenagh, N. J. and Billington, E. J. (2000). Decompositions of complete multipartite graphs into cycles of even length. Graphs and Combinatorics, 16 (1), 49-65. doi: 10.1007/s003730050003

Adams, P., Billington, E. J., Dejter, I. J. and Lindner, C. C. (2000). The number of 4-cycles in 2-factorizations of K2n minus a 1-factor. Discrete Mathematics, 220 (Nos 1-3 in one), 1-11. doi: 10.1016/S0012-365X(99)00377-5

Cavenagh, N. J. and Billington, E. J. (2000). On decomposing complete tripartite graphs into 5-cycles. The Australasian Journal of Combinatorics, 22, 41-62.

Billington, E. J. (1999). Decomposing complete tripartite graphs into cycles of lengths 3 and 4. Discrete Mathematics, 197/198 (1-3), 123-135. doi: 10.1016/S0012-365X(98)00227-1

Billington, E. J., Hoffman, D. G. and Maenhaut, B. H. (1999). Group divisible pentagon systems. Utilitas Mathematica, 55 (May 1999), 211-219.

Billington, EJ and Bryant, DE (1999). The possible number of cycles in cycle systems. ARS Combinatoria, 52, 65-70.

Billington, EJ and Hoffman, DG (1998). The intersection problem for star designs. Discrete Mathematics, 179 (1-3), 217-222. doi: 10.1016/S0012-365X(97)00092-7

Billington, Elizabeth J., Gionfriddo, M. and Lindner, C. C. (1997). The intersection problem for K4 - E designs. Journal of Statistical Planning and Inference, 58 (1), 5-27.

Billington, EJ, Gionfriddo, M and Lindner, CC (1997). The intersection problem for K_4-e designs. Journal of Statistical Planning And Inference, 58 (1), 5-27. doi: 10.1016/S0378-3758(96)00056-0

Adams, P, Billington, E.J. and Hoffman, D.G. (1997). On the spectrum for K_{m+2}/K_m designs. Journal of Combinatorial Designs, 5 (1), 49-60. doi: 10.1002/(SICI)1520-6610(1997)5:1<49::AID-JCD4>3.0.CO;2-Y

Adams, P, Billington, EJ and Bryant, DE (1996). The spectrum for lambda-fold Steiner pentagon systems. Journal of Statistical Planning and Inference, 56 (1), 3-15.

Adams, Peter, Billington, Elizabeth J. and Bryant, Darryn E. (1996). Partitionable perfect cycle systems with cycle lengths 6 and 8. Discrete Mathematics, 149 (1-3), 1-9.

Adams, P, Billington, EJ and Bryant, DE (1996). Partitionable perfect cycle systems with cycle lengths 6 and 8. Discrete Mathematics, 149 (1-3), 1-9. doi: 10.1016/0012-365X(94)00305-3

Adams, P. and Billington, E. J. (1996). Lambda-fold 3-perfect 9-cycle systems. Ars Combinatoria, 44, 241-262.

Billington, Elizabeth J. and Lindner, C. C. (1994). The spectrum for 2-perfect bowtie systems. Discrete Mathematics, 135 (1-3), 61-68. doi: 10.1016/0012-365X(93)E0008-R

Billington, Elizabeth J. (1993). The intersection problem for m‐cycle systems. Journal of Combinatorial Designs, 1 (6), 435-452. doi: 10.1002/jcd.3180010605

Billington, Elizabeth J. and Lindner, C. C. (1992). The spectrum for lambda-fold 2-perfect 6-cycle systems. European Journal of Combinatorics, 13 (1), 5-14. doi: 10.1016/0195-6698(92)90063-6

Billington E.J. (1989). Note New Cyclic (61,244,40,10,6) BIBDs. Annals of Discrete Mathematics, 42 (C), 51-53. doi: 10.1016/S0167-5060(08)70095-5

Billington, Elizabeth J. (1982). More balanced ternary designs with block size three. Discrete Mathematics, 39 (1), 9-21. doi: 10.1016/0012-365X(82)90036-X

Fitz-Gerald J.M. and Billington E.J. (1981). Manufacturing sequences for the Economic Lot Scheduling problem. Bulletin of the Australian Mathematical Society, 24 (3), 405-431. doi: 10.1017/S0004972700004949

Billington, Elizabeth J., Cavenagh, Nicholas J. and Smith, Benjamin R. (2010). Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts. 21st British Combinatorial Conference 2007, Reading, U.K., 9-13 July 2007. Amsterdam, The Netherlands: Elsevier. doi: 10.1016/j.disc.2008.09.003

Morgan, Elizabeth Jane (1978). Construction of block designs and related results. PhD Thesis, School of Physical Sciences, The University of Queensland. doi: 10.14264/uql.2014.441

Dr Elizabeth Billington

Publications

Book Chapters

Journal Articles

Conference Paper

Thesis

Areas of research