Currently browsing: Items authored or edited by Fred Holroyd

11 items in this list.
Generated on Sat Jan 28 07:49:23 2023 GMT.

Jump to:

2012 | 2011 | 2010 | 2009 | 2005 | 2004 | 2001 | 2000

2012To Top

Forbes, A. D.; Griggs, T. S. and Holroyd, F. C. (2012). Truncated Tetrahedron, Octahedron and Cube Designs. Journal of Combinatorial Mathematics and Combinatorial Computing, 80 pp. 95–111.

2011To Top

Holroyd, Fred and Watts, Ivor (2011). Overlap colourings and homomorphisms of graphs. The Quarterly Journal of Mathematics, 62(4) pp. 989–1001.

2010To Top

Forbes, A. D.; Griggs, T. S. and Holroyd, F. C. (2010). Rhombicuboctahedron Designs. Journal of Combinatorial Mathematics and Combinatorial Computing, 75 pp. 161–165.

Hilton, A. J. W.; Holroyd, F. C. and Spencer, C. L. (2010). King Arthur and his knights with two round tables. The Quarterly Journal of Mathematics, 62(3) pp. 625–635.

2009To Top

Borg, Peter and Holroyd, Fred (2009). The Erdös-Ko-Rado properties of set systems defined by double partitions. Discrete Mathematics, 309(14) pp. 4754–4761.

2005To Top

Holroyd, Fred; Spencer, Claire and Talbot, John (2005). Compression and Erdos-Ko-Rado graphs. Discrete Mathematics, 293(1-3) pp. 155–164.

Holroyd, Fred and Talbot, John (2005). Graphs with the Erdos-Ko-Rado property. Discrete Mathematics, 293(1-3) pp. 165–176.

2004To Top

Holroyd, Fred and Skoviera, Martin (2004). Colouring of cubic graphs by Steiner triple systems. Journal of Combinatorial Theory, Series B, 91(1) pp. 57–66.

2001To Top

Grannell, M.J.; Griggs, T.S. and Holroyd, F.C. (2001). Modular gracious labellings of trees. Discrete Mathematics, 231(1-3) pp. 199–219.

2000To Top

Grannell, Mike; Griggs, Terry and Holroyd, Fred (2000). Cuboctahedron designs. Journal of Combinatorial Mathematics and Combinatorial Computing, 35, pp. 185–191.

Export

Subscribe to these results

get details to embed this page in another page Embed as feed [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0