The Open UniversitySkip to content
 

Browse by Journal

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 | No Grouping
Number of items: 18.

Albert, Michael H. and Brignall, Robert (2014). Enumerating indices of Schubert varieties defined by inclusions. Journal of Combinatorial Theory, Series A, 123(1) pp. 154–168.

Archdeacon, D.; Bonnington, P.; Richter, B. and Siran, J. (2002). Sewing ribbons on graphs in space. Journal of Combinatorial Theory, Series B, 86(1) pp. 1–26.

Bonnington, C. P.; Grannell, M. J.; Griggs, T. S. and Siran, J. (2000). Exponential families of non-isomorphic triangulations of complete graphs. Journal of Combinatorial Theory, Series B, 78(2) pp. 169–184.

Brignall, Robert; Huczynska, Sophie and Vatter, Vincent (2008). Simple permutations and algebraic generating functions. Journal of Combinatorial Theory, Series A, 115(3) pp. 423–441.

Brignall, Robert (2012). Grid classes and partial well order. Journal of Combinatorial Theory, Series A, 119(1) pp. 99–116. file

Conder, Marston D. E.; Kwon, Young Soo and Širáň, Jozef (2009). Reflexibility of regular Cayley maps for abelian groups. Journal of Combinatorial Theory, Series B, 99(1) pp. 254–260.

Conder, Marston; Nedela, Roman and Siran, Jozef (2012). Classification of regular maps of Euler characteristic -3p. Journal of Combinatorial Theory, Series B, 102(4) pp. 967–981. file

Danziger, Peter; Horsley, Daniel and Webb, Bridget S. (2014). Resolvability of infinite designs. Journal of Combinatorial Theory, Series A, 123(1) pp. 73–85. file

Danziger, Peter; Wanless, Ian M. and Webb, Bridget S. (2011). Monogamous latin squares. Journal of Combinatorial Theory, Series A, 118(3) pp. 796–807.

Donovan, D. M. and Grannell, M. J. (2013). On the number of transversal designs. Journal of Combinatorial Theory, Series A, 120(7) pp. 1562–1574.

Forbes, A.D.; Grannell, M.J. and Griggs, T.S. (2007). On 6-sparse Steiner triple systems. Journal of Combinatorial Theory, Series A, 114(2) pp. 235–252.

Goddyn, Luis; Richter, R. Bruce and Širáň, Jozef (2007). Triangular embeddings of complete graphs from graceful labellings of paths. Journal of Combinatorial Theory, Series B, 97(6) pp. 964–970.

Grannell, M. J. and Griggs, T. S. (2008). A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs. Journal of Combinatorial Theory, Series B, 98 pp. 637–650.

Grannell, M. J. and Knor, M. (2010). A lower bound for the number of orientable triangular embeddings of some complete graphs. Journal of Combinatorial Theory, Series B, 100(2) pp. 216–225.

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

Li, Cai Heng and Širáň, Jozef (2007). Möbius regular maps. Journal of Combinatorial Theory, Series B, 97(1) pp. 57–73.

Richter, R. Bruce; Siran, Jozef; Jajcay, Robert; Tucker, Thomas W. and Watkins, Mark E. (2005). Cayley maps. Journal of Combinatorial Theory, Series B, 95(2) pp. 189–245.

Šiagiová, Jana and Siran, Jozef (2012). Approaching the Moore bound for diameter two by Cayleygraphs. Journal of Combinatorial Theory, Series B, 102(2) pp. 470–473. file

This list was generated on Thu Aug 21 21:51:49 2014 BST.

Policies | Disclaimer

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