Browse Publications

  1. 1995
  2. Publications content icon
    Published

    Linear codes and doubly transitive symmetric designs

    Chris Parker, 1 Jan 1995, In : Linear Algebra and its Applications. 226-228, C, p. 237-246 10 p.

    Research output: Contribution to journalArticle

  3. 1996
  4. Publications content icon
    Published

    Recognition of the ℓ1-graphs with complexity O(nm), or football in a hypercube

    Sergey Shpectorov, 1 Jan 1996, In : European Journal of Combinatorics. 17, 2-3, p. 279-289 11 p.

    Research output: Contribution to journalArticle

  5. 2000
  6. Publications content icon
    Published

    Cayley type graphs and cubic graphs of large girth

    John Bray, Chris Parker, 21 Mar 2000, In : Discrete Mathematics. 214, 1-3, p. 113-121 9 p.

    Research output: Contribution to journalArticle

  7. 2001
  8. Publications content icon
    Published

    Completions of Goldschmidt Amalgams of Type G4 in Dimension 3

    Chris Parker, 1 Jan 2001, In : Journal of Algebraic Combinatorics. 13, 1, p. 77-82 6 p.

    Research output: Contribution to journalArticle

  9. 2009
  10. Publications content icon
    Published

    Degree sequences forcing Hamilton cycles in directed graphs

    Daniela Kuhn, Deryk Osthus & Andrew Treglown, 1 Aug 2009, In : Electronic Notes in Discrete Mathematics. 34, p. 347-351 5 p.

    Research output: Contribution to journalArticle

  11. 2011
  12. Publications content icon
    Published
  13. 2012
  14. Publications content icon
    Published

    Rainbow matchings of size δ(G) in properly edge-colored graphs

    Allan Lo, 28 Jun 2012, In : Electronic Journal of Combinatorics. 19, 2

    Research output: Contribution to journalArticle

  15. 2013
  16. Publications content icon
    Published

    There is no upper bound for the diameter of the commuting graph of a finite group

    Chris Parker, 1 Sep 2013, In : Journal of Combinatorial Theory. Series A. 120, 7, p. 1600-1603 4 p.

    Research output: Contribution to journalArticle

  17. 2014
  18. Publications content icon
    Published

    Decompositions of complete uniform hypergraphs into Hamilton Berge cycles

    Daniela Kuhn & Deryk Osthus, 1 Jan 2014, In : Journal of Combinatorial Theory, Series A. 126, 1, p. 128-135 8 p.

    Research output: Contribution to journalArticle

  19. Publications content icon
    Published

    Optimal covers with Hamilton cycles in random graphs

    Dan Hefetz, Daniela Kuhn & Deryk Osthus, Oct 2014, In : Combinatorica. 34, 5, p. 573–596

    Research output: Contribution to journalArticle

Previous 1 2 3 Next