Alexander Rosa

Articles in Scholarly Journals [Incomplete List]

  1. Extended Petersen graphs
    Discrete Mathematics, vol. 299, no. 1-3, pp. 129–140, 2005
  2. Preface
    Discrete Mathematics, vol. 299, no. 1-3, pp. 1–1, 2005
  3. Embedding Steiner triple systems into Steiner systems S(2,4,v)
    Discrete Mathematics, vol. 274, no. 1-3, pp. 199–212, 2004
  4. The metamorphosis of λ-fold block designs with block size four into a maximum packing of λKn with 4-cycles
    Discrete Mathematics, vol. 278, no. 1-3, pp. 175–193, 2004
  5. Bicolouring Steiner systems S(2,4,v)
    Discrete Mathematics, vol. 283, no. 1-3, pp. 249–253, 2004
  6. The Hamilton–Waterloo problem: the case of Hamilton cycles and triangle-factors
    Discrete Mathematics, vol. 284, no. 1-3, pp. 181–188, 2004
  7. Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index
    Graphs and Combinatorics, vol. 19, no. 3, pp. 335–345, 2003
  8. The metamorphosis of λ-fold block designs with block size four into λ-fold triple systems
    Journal of Statistical Planning and Inference, vol. 106, no. 1-2, pp. 69–76, 2002
  9. Completing the spectrum of 2-chromatic S(2,4,v)
    Discrete Mathematics, vol. 247, no. 1-3, pp. 225–228, 2002
  10. Maximal arcs in Steiner systems S(2,4,v)
    Discrete Mathematics, 2002
  11. Designs, Codes and Cryptography, vol. 26, no. 1/3, pp. 243–256, 2002
  12. Colouring Steiner systems with specified block colour patterns
    Discrete Mathematics, vol. 240, no. 1-3, pp. 145–160, 2001
  13. Two-factorizations of small complete graphs
    Journal of Statistical Planning and Inference, vol. 86, no. 2, pp. 435–442, 2000
  14. Symmetric graph designs on friendship graphs
    Journal of Combinatorial Designs, vol. 8, no. 3, p. 201, 2000
  15. Symmetric Graph Designs
    Graphs and Combinatorics, vol. 16, no. 1, pp. 93–102, 2000
  16. Ubiquitous configurations in Steiner triple systems
    Journal of Combinatorial Designs, vol. 5, no. 1, pp. 13–31, 1997
  17. Designs, Codes and Cryptography, vol. 12, no. 1, pp. 59–67, 1997
  18. Triangles in 2‐factorizations
    Journal of Graph Theory, vol. 26, no. 2, pp. 83–94, 1997
  19. The Existence of Selfcomplementary Circulant Graphs
    European Journal of Combinatorics, vol. 17, no. 7, pp. 625–628, 1996
  20. Bipartite labelings of trees and the gracesize
    Journal of Graph Theory, vol. 19, no. 2, pp. 201–215, 1995
  21. Addendum: A Class of Steiner Triple Systems of Order 21 and Associated Kirkman Systems
    Mathematics of Computation, vol. 64, no. 211, p. 1355, 1995
  22. Packing pentagons into complete graphs: how clumsy can you get?
    Discrete Mathematics, vol. 128, no. 1-3, pp. 305–316, 1994
  23. The spectrum of maximal partial steiner triple systems
    Designs, Codes and Cryptography, vol. 3, no. 3, pp. 209–219, 1993
  24. Maximal Sets of 2-Factors and Hamiltonian Cycles
    Journal of Combinatorial Theory, Series B, vol. 57, no. 1, pp. 69–76, 1993
  25. On a class of completable partial edge-colourings
    Discrete Applied Mathematics, vol. 35, no. 3, pp. 293–299, 1992
  26. Halving Steiner triple systems
    Discrete Mathematics, vol. 109, no. 1-3, pp. 59–67, 1992
  27. The fine structure of threefold triple systems: υ ≡ 1 or 3 (mod 6)
    Discrete Mathematics, vol. 92, no. 1-3, pp. 49–64, 1991
  28. Partitioning Steiner triple systems into complete arcs
    Discrete Mathematics, vol. 89, no. 2, pp. 149–160, 1991
  29. Preface
    Discrete Mathematics, vol. 97, no. 1-3, p. 1, 1991
  30. Repeated edges in 2-factorizations
    Journal of Graph Theory, vol. 14, no. 1, pp. 5–24, 1990
  31. Hybrid triple systems and cubic feedback sets
    Graphs and Combinatorics, vol. 5, no. 1, pp. 15–28, 1989
  32. On Alspach's conjecture
    Discrete Mathematics, vol. 77, no. 1-3, pp. 97–121, 1989
  33. On the (15, 5, λ)-family of BIBDs
    Discrete Mathematics, vol. 77, no. 1-3, pp. 205–216, 1989
  34. The strong chromatic number of partial triple systems
    Discrete Applied Mathematics, vol. 20, no. 1, pp. 31–38, 1988
  35. Element neighbourhoods in twofold triple systems
    Journal of Geometry, vol. 30, no. 1, pp. 36–41, 1987
  36. Repeated blocks in indecomposable twofold triple systems
    Discrete Mathematics, vol. 65, no. 3, pp. 261–276, 1987
  37. Quadratic leaves of maximal partial triple systems
    Graphs and Combinatorics, vol. 2, no. 1, pp. 317–337, 1986
  38. The number of repeated blocks in twofold triple systems
    Journal of Combinatorial Theory, Series A, vol. 41, no. 1, pp. 61–88, 1986
  39. A new strongly regular graph
    Journal of Combinatorial Theory, Series A, vol. 38, no. 1, pp. 84–86, 1985
  40. One-factorizations of the complete graph—A survey
    Journal of Graph Theory, vol. 9, no. 1, pp. 43–65, 1985
  41. Further properties of generalized residual designs
    Journal of Statistical Planning and Inference, vol. 10, no. 1, pp. 59–68, 1984
  42. Completing small partial triple systems
    Discrete Mathematics, vol. 45, no. 2-3, pp. 165–179, 1983
  43. Premature sets of 1-factors or how not to schedule round robin tournaments
    Discrete Applied Mathematics, vol. 4, no. 4, pp. 291–297, 1982
  44. A Class of Steiner Triple Systems of Order 21 and Associated Kirkman Systems
    Mathematics of Computation, vol. 37, no. 155, p. 209, 1981
  45. Steiner triple systems with rotational automorphisms
    Discrete Mathematics, vol. 33, no. 1, pp. 57–66, 1981
  46. On a variation of the Oberwolfach problem
    Discrete Mathematics, vol. 27, no. 3, pp. 261–277, 1979
  47. Steiner quadruple systems - a survey
    Discrete Mathematics, vol. 22, no. 2, pp. 147–181, 1978
  48. Finite embedding theorems for partial Steiner triple systems
    Discrete Mathematics, vol. 13, no. 1, pp. 31–39, 1975
  49. Another class of balanced graph designs: balanced circuit designs
    Discrete Mathematics, vol. 12, no. 3, pp. 269–293, 1975
  50. Some results on the Oberwolfach problem
    Aequationes Mathematicae, vol. 12, no. 1, pp. 1–5, 1975
  51. On the existence of automorphism free Steiner triple systems
    Journal of Algebra, vol. 34, no. 3, pp. 430–443, 1975
  52. Decomposition of Complete Graphs into Isomorphic Factors with a Given Diameter
    Bulletin of the London Mathematical Society, vol. 7, no. 1, pp. 51–57, 1975
  53. Some results on the Oberwolfach problem
    Aequationes Mathematicae, vol. 11, no. 2-3, pp. 316–316, 1974
  54. On reverse Steiner triple systems
    Discrete Mathematics, vol. 2, no. 1, pp. 61–71, 1972
  55. Graph decompositions, handcuffed prisoners and balanced P-designs
    Discrete Mathematics, vol. 2, no. 3, pp. 229–252, 1972