1. Bipartite 2‐Factorizations of Complete Multipartite Graphs. Issue 4 (7th May 2014) Authors: Bryant, Darryn; Danziger, Peter; Pettersson, William Journal: Journal of graph theory Issue: Volume 78:Issue 4(2015) Page Start: 287 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Cycle decompositions V: Complete graphs into cycles of arbitrary lengths. Issue 5 (16th October 2013) Authors: Bryant, Darryn; Horsley, Daniel; Pettersson, William Journal: Proceedings of the London Mathematical Society Issue: Volume 108:Issue 5(2014:May) Page Start: 1153 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Decomposing Graphs of High Minimum Degree into 4‐Cycles. Issue 3 (10th July 2014) Authors: Bryant, Darryn; Cavenagh, Nicholas J. Journal: Journal of graph theory Issue: Volume 79:Issue 3(2015) Page Start: 167 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. On determining when small embeddings of partial Steiner triple systems exist. Issue 8 (17th March 2020) Authors: Bryant, Darryn; De Vas Gunasekara, Ajani; Horsley, Daniel Journal: Journal of combinatorial designs Issue: Volume 28:Issue 8(2020:Aug.) Page Start: 568 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. On Hamilton decompositions of infinite circulant graphs. Issue 3 (22nd December 2017) Authors: Bryant, Darryn; Herke, Sarada; Maenhaut, Barbara; Webb, Bridget S. Journal: Journal of graph theory Issue: Volume 88:Issue 3(2018) Page Start: 434 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors. Issue 2 (29th May 2012) Authors: Bryant, Darryn; Danziger, Peter; Dean, Matthew Journal: Journal of combinatorial designs Issue: Volume 21:Issue 2(2013:Feb.) Page Start: 60 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. Uniform decompositions of complete multigraphs into cycles. Issue 12 (27th September 2018) Authors: Berry, Duncan; Bryant, Darryn; Dean, Matthew; Maenhaut, Barbara Journal: Journal of combinatorial designs Issue: Volume 26:Issue 12(2018:Dec.) Page Start: 595 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
8. Vertex‐Transitive Graphs of Prime‐Squared Order Are Hamilton‐Decomposable. Issue 1 (15th October 2013) Authors: Alspach, Brian; Bryant, Darryn; Kreher, Donald L. Journal: Journal of combinatorial designs Issue: Volume 22:Issue 1(2014:Jan.) Page Start: 12 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗