The Open UniversitySkip to content
 

Items Authored or Edited by Fred Holroyd

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0 [Create Shortened URL] SURL
Group by: Published Date | Item Type | Authors/Editors/Creators | No Grouping
Jump to: 2010 | 2009 | 2005 | 2004 | 2001 | 2000
Number of items: 9.

2010

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. file

Holroyd, Fred and Watts, Ivor (2010). Overlap colourings and homomorphisms of graphs. The Quarterly Journal of Mathematics [in press]. file

2009

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. file

Borg, Peter and Holroyd, Fred (2009). The Erdős-Ko-Rado properties of various graphs containing singletons. Discrete Mathematics, 309(9) pp. 2877–2885. file

2005

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

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

2004

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. file

2001

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

2000

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

This list was generated on Thu Jul 24 23:05:02 2014 BST.

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340   general-enquiries@open.ac.uk