|
2014 Journal Article Vertex-transitive graphs of prime-squared order are Hamilton-decomposableAlspach, Brian, Bryant, Darryn and Kreher, Donald L. (2014). Vertex-transitive graphs of prime-squared order are Hamilton-decomposable. Journal of Combinatorial Designs, 22 (1), 12-25. doi: 10.1002/jcd.21381 |
|
2014 Journal Article Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphsBryant, Darryn, Herke, Sarada, Maenhaut, Barbara and Wannasit, Wannasiri (2014). Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs. Australasian Journal of Combinatorics, 60 (2), 227-254. |
|
2013 Journal Article A second infinite family of Steiner triple systems without almost parallel classesBryant, Darryn and Horsley, Daniel (2013). A second infinite family of Steiner triple systems without almost parallel classes. Journal of Combinatorial Theory, Series A, 120 (7), 1851-1854. doi: 10.1016/j.jcta.2013.07.002 |
|
2013 Journal Article On the Hamilton-Waterloo problem for bipartite 2-factorsBryant, Darryn, Danziger, Peter and Dean, Matthew (2013). On the Hamilton-Waterloo problem for bipartite 2-factors. Journal of Combinatorial Designs, 21 (2), 60-80. doi: 10.1002/jcd.21312 |
|
2012 Journal Article Decomposing the complete graph into dodecahedraAdams, P., Bryant, D. E., Forbes, A. D. and Griggs, T. S. (2012). Decomposing the complete graph into dodecahedra. Journal of Statistical Planning and Inference, 142 (5), 1040-1046. doi: 10.1016/j.jspi.2011.11.001 |
|
2012 Journal Article Small embeddings for partial triple systems of odd indexBryant, Darryn and Martin, Geoffrey (2012). Small embeddings for partial triple systems of odd index. Journal of Combinatorial Theory: Series A, 119 (2), 283-309. doi: 10.1016/j.jcta.2011.09.008 |
|
2012 Journal Article Paley graphs have Hamilton decompositionsAlspach, Brian, Bryant, Darryn and Dyer, Danny (2012). Paley graphs have Hamilton decompositions. Discrete Mathematics, 312 (1), 113-118. doi: 10.1016/j.disc.2011.06.003 |
|
2012 Journal Article Nonextendible Latin CuboidsBryant, Darryn, Cavenagh, Nicholas J., Maenhaut, Barbara, Pula, Kyle and Wanless, Ian M. (2012). Nonextendible Latin Cuboids. Siam Journal on Discrete Mathematics, 26 (1), 239-249. doi: 10.1137/110825534 |
|
2011 Journal Article On the non-existence of pair covering designs with at least as many points as blocksBryant, Darryn, Buchanan, Melinda, Horsley, Daniel, Maenhaut, Barbara and Scharaschkin, Victor (2011). On the non-existence of pair covering designs with at least as many points as blocks. Combinatorica, 31 (5), 507-528. doi: 10.1007/s00493-011-2639-y |
|
2011 Journal Article On bipartite 2-factorizations of K(n)-I and the Oberwolfach problemBryant, Darryn and Danziger, Peter (2011). On bipartite 2-factorizations of K(n)-I and the Oberwolfach problem. Journal of Graph Theory, 68 (1), 22-37. doi: 10.1002/jgt.20538 |
|
2011 Journal Article On the existence and embedding of edge-coloured graph decompositionsBrier, Robert and Bryant, Darryn (2011). On the existence and embedding of edge-coloured graph decompositions. Ars Combinatoria, 99, 445-459. |
|
2011 Journal Article Cycle Decompositions of Complete MultigraphsBryant, D, Horsley, D, Maenhaut, B and Smith, BR (2011). Cycle Decompositions of Complete Multigraphs. Journal of Combinatorial Designs, 19 (1), 42-69. doi: 10.1002/jcd.20263 |
|
2010 Journal Article An asymptotic solution to the cycle decomposition problem for complete graphsBryant, Darryn and Horsley, Daniel (2010). An asymptotic solution to the cycle decomposition problem for complete graphs. Journal of Combinatorial Theory Series A, 117 (8), 1258-1284. doi: 10.1016/j.jcta.2010.03.015 |
|
2010 Journal Article Defining scaffold geometries for interacting with proteins: Geometrical classification of secondary structure linking regionsTran, Tran T., Kulis, Christina, Long, Steven M., Bryant, Darryn, Adams, Peter and Smythe, Mark L. (2010). Defining scaffold geometries for interacting with proteins: Geometrical classification of secondary structure linking regions. Journal of Computer-Aided Molecular Design, 24 (11), 917-934. doi: 10.1007/s10822-010-9384-y |
|
2010 Journal Article Decompositions of complete graphs into long cyclesBryant, Darryn and Horsley, Daniel (2010). Decompositions of complete graphs into long cycles. Bulletin of the London Mathematical Society, 41 (5), 927-934. doi: 10.1112/blms/bdp069 |
|
2010 Journal Article Packing paths in complete graphsBryant, Darryn (2010). Packing paths in complete graphs. Journal of Combinatorial Theory, Series B, 100 (2), 206-215. doi: 10.1016/j.jctb.2009.08.004 |
|
2009 Journal Article Complete solutions to the Oberwolfach problem for an infinite set of ordersBryant, Darryn and Scharaschkin, Victor (2009). Complete solutions to the Oberwolfach problem for an infinite set of orders. Journal of Combinatorial Theory, Series B, 99 (6), 904-918. doi: 10.1016/j.jctb.2009.03.003 |
|
2009 Journal Article Indivisible plexes in latin squaresBryant, D., Egan, J., Maenhaut, B. and Wanless, I. M. (2009). Indivisible plexes in latin squares. Designs, Codes and Cryptography, 52 (1), 93-105. doi: 10.1007/s10623-009-9269-z |
|
2009 Journal Article Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-completeBryant, D. (2009). Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete. Discrete Mathematics, 309 (14), 4700-4704. doi: 10.1016/j.disc.2008.05.037 |
|
2009 Journal Article The nonexistence of a (K6-e)-decomposition of the complete graph K29Hartke, S. G., Ostergard, P. R. J., Bryant, D. and El-Zanati, S. I. (2009). The nonexistence of a (K6-e)-decomposition of the complete graph K29. Journal of Combinatorial Designs, 18 (2), 94-104. doi: 10.1002/jcd.20226 |
