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
Jump to: 2014 | 2012 | 2011 | 2010 | 2009 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 2000
Number of items: 40.


Brignall, Robert; Lozin, Vadim V. and Stacho, Juraj (2014). Bichain graphs: geometric model and universal graphs. Discrete Applied Mathematics (In press).


Dutour Sikirić, M.; Knor, M.; Potocnik, P.; Siran, J. and Škrekovski, R. (2012). Hyperbolic analogues of fullerenes on orientable surfaces. Discrete Mathematics, 312(4) pp. 729–736.

Macbeth, Heather; Šiagiová, Jana and Širáň, Jozef (2012). Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups. Discrete Mathematics, 312(1) pp. 94–99. file


Cardoso, Domingos M.; Korpelainen, Nicholas and Lozin, Vadim V. (2011). On the complexity of the dominating induced matching problem in hereditary classes of graphs. Discrete Applied Mathematics, 159(7) pp. 521–531.

Drizen, A.L.; Grannell, Mike and Griggs, Terry (2011). Pasch trades with a negative block. Discrete Mathematics, 311(21) pp. 2411–2416.

Korpelainen, Nicholas and Lozin, Vadim (2011). Two forbidden induced subgraphs and well-quasi-ordering. Discrete Mathematics, 311(16) pp. 1813–1822.


Donovan, D. M.; Drápal, A.; Grannell, M. J.; Griggs, T. S. and Lefevre, J. G. (2010). Quarter-regular biembeddings of Latin squares. Discrete Mathematics, 310(4) pp. 692–699.

Duchamp, Gerard H. E.; Poinsot, Laurent; Solomon, Allan I.; Penson, Karol A.; Blasiak, Pawel and Horzela, Andrzej (2010). Ladder operators and endomorphisms in combinatorial Physics. Discrete Mathematics & Theoretical Computer Science, 12(2) pp. 23–46.

Penson, Karol A.; Blasiak, Pawel; Duchamp, Gerard H. E.; Horzela, Andrzej and Solomon, Allan I. (2010). On certain non-unique solutions of the Stieltjes moment problem. Discrete Mathematics & Theoretical Computer Science, 12(2) pp. 295–306.


Borg, Peter (2009). A short proof of a cross-intersection theorem of Hilton. Discrete Mathematics, 309(14) pp. 4750–4753.

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

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

Brignall, Robert; Ekhad, Shalosh B.; Smith, Rebecca and Vatter, Vincent (2009). Almost avoiding permutations. Discrete Mathematics, 309(23-24) pp. 6626–6631.

Grannell, M. J.; Griggs, T. S. and Quinn, K. A. S. (2009). Smallest defining sets of directed triple systems. Discrete Mathematics, 309(14) pp. 4810–4818.

Grannell, M.J. and Korzhik, V.P. (2009). Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs. Discrete Mathematics, 309(9) pp. 2847–2860.

Grannell, Mike J.; Griggs, Terry S.; Máčajová, Edita and Škoviera, Martin (2009). Wilson-Schreiber colourings of cubic graphs. Electronic Notes in Discrete Mathematics, 34 pp. 225–229.

Huck, Christian (2009). On the existence of U-polygons of class c≥4 in planar point sets. Discrete Mathematics, 309(16) pp. 4977–4981.

Korpelainen, Nicholas (2009). A polynomial-time algorithm for the dominating induced matching problem in the class of convex graphs. In: DIMAP Workshop on Algorithmic Graph Theory, 23-25 March 2009, Warwick, UK, Elsevier, pp. 133–140.


Knor, Martin and Širáň, Jozef (2008). Regular hamiltonian embeddings of Kn,n and regular triangular embeddings of Kn,n,n. Discrete Mathematics, 308(20) pp. 4796–4800.

Širáň, Jozef (2008). Recent progress in classification of regular maps on a given compact surface. Electronic Notes in Discrete Mathematics, 31, pp. 19–22.


Mačaj, Martin; Širáň, Jozef and Ipolyiová, Mária (2007). Planar width of regular maps. Electronic Notes in Discrete Mathematics, 28, pp. 477–484.


Bennett, G. K.; Grannell, M. J.; Griggs, T. S. and Siran, J. (2006). Small surface trades in triangular embeddings. Discrete Mathematics, 306(21) pp. 2637–2646.

Grannell, M. J.; Griggs, T. S.; Knor, M. and Siran, J. (2006). Triangulations of orientable surfaces by complete tripartite graphs. Discrete Mathematics, 306(6) pp. 600–606.


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

Siagiova, J. and Siran, J. (2005). A note on large Cayley graphs of diameter two and given degree. Discrete Mathematics, 305(1-3) pp. 379–382.


Archdeacon, D.; Bonnington, P. and Siran, J. (2004). Halin's theorem for cubic graphs on an annulus. Discrete Mathematics, 281(1-3) pp. 13–25.

Bryant, Darryn; Maenhaut, Barbara; Quinn, Kathleen and Webb, Bridget S. (2004). Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves. Discrete Mathematics, 284(1-3) pp. 83–95.

Grannell, M.J. and Korzhik, V.P. (2004). Nonorientable biembeddings of Steiner triple systems. Discrete Mathematics, 285(1-3) pp. 121–126.


Aldred, R.; Siran, M. and Siran, J. (2003). A note on the number of graceful labellings of paths. Discrete Mathematics, 261(1-3) pp. 27–30.

Forbes, A.D.; Grannell, M.J. and Griggs, T.S. (2003). On colourings of Steiner triple systems. Discrete Mathematics, 261(1-3) pp. 255–276.

Grannell, M.J.; Griggs, T.S.; Korzhik, V.P. and Siran, Jozef (2003). On the minimal nonzero distance between triangular embeddings of a complete graph. Discrete Mathematics, 269(1-3) pp. 149–160.


Franek, F.; Griggs, T.S.; Lindner, C.C and Rosa, A. (2002). Completing the spectrum of 2-chromatic S(2, 4, v). Discrete Mathematics, 247(1-3) pp. 225–228.

Hahn, G.; Kratochvil, J.; Sotteau, D. and Siran, J. (2002). On the injective chromatic number of graphs. Discrete Mathematics, 256(1-2) pp. 179–192.

Jajcay, R. and Siran, J. (2002). Skew-morphisms of regular Cayley maps. Discrete Mathematics, 244(1-3) pp. 167–179.

Shim, S.; Zerovnik, J. and Siran, J. (2002). Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs. Discrete Applied Mathematics, 119(3) pp. 281–286.


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

Miller, M. and Siran, J. (2001). Digraphs of degree two which miss the Moore bound by two. Discrete Mathematics, 226(1-3) pp. 269–280.

Siran, Jozef (2001). Triangle group representations and their applications to graphs and maps. Discrete Mathematics, 229(1-3) pp. 341–358.


Miller, Mirka; Gimbert, Joan; Širáň, Jozef and Slamin, S. (2000). Almost Moore digraphs are diregular. Discrete Mathematics, 218(1-3) pp. 265–270.

This list was generated on Sun Oct 19 04:11:06 2014 BST.

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340