Alexander Rosa

According to our database1, Alexander Rosa authored at least 86 papers between 1972 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Greedy triple systems.
Bull. ICA, 2019

Cyclic and rotational six-cycle systems.
Bull. ICA, 2019

2018
Reaction graphs of double Fano planes.
Art Discret. Appl. Math., 2018

2017
A possible analogue of ρ-labellings for 3-uniform hypergraphs.
Electron. Notes Discret. Math., 2017

Kite systems of order 8; embedding of kite systems into bowtie systems.
Australas. J Comb., 2017

2016
Decompositions of complete graphs into circulants.
Discret. Math., 2016

2015
On a problem of Mariusz Meszka.
Discret. Math., 2015

Almost 2-perfect 6-cycle systems.
Des. Codes Cryptogr., 2015

Cubic leaves.
Australas. J Comb., 2015

Steiner loops satisfying Moufang's theorem.
Australas. J Comb., 2015

2013
Triple metamorphosis of twofold triple systems.
Discret. Math., 2013

Palettes in block colourings of designs.
Australas. J Comb., 2013

2012
Extra two-fold Steiner pentagon systems.
Discret. Math., 2012

2009
Steiner almost self-complementary graphs and halving near-Steiner triple systems.
Discret. Math., 2009

On a Problem of Marco Buratti.
Electron. J. Comb., 2009

On (K<sub>4</sub>, K<sub>4</sub>-e)-Designs.
Ars Comb., 2009

Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles.
Australas. J Comb., 2009

2008
Equitable Specialized Block-Colourings for Steiner Triple Systems.
Graphs Comb., 2008

The chromatic number of 5-valent circulants.
Discret. Math., 2008

Perfect dexagon triple systems.
Discret. Math., 2008

Preface.
Discret. Math., 2008

2005
Preface.
Discret. Math., 2005

Extended Petersen graphs.
Discret. Math., 2005

Lambda-fold complete graph decompositions into perfect four-triple configurations.
Australas. J Comb., 2005

2004
Embedding Steiner triple systems into Steiner systems <i>S</i>(2, 4, <i>v</i>).
Discret. Math., 2004

The metamorphosis of lambda-fold block designs with block size four into a maximum packing of lambda<i>K<sub>n</sub></i> with 4-cycles.
Discret. Math., 2004

The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors.
Discret. Math., 2004

Bicolouring Steiner systems <i>S</i>(2, 4, <i>v</i>).
Discret. Math., 2004

2003
Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index.
Graphs Comb., 2003

Maximal arcs in Steiner systems S(2, 4, <i>v</i>).
Discret. Math., 2003

Resolving P(v, 3, λ) designs into regular P<sub>3</sub>-configurations.
Australas. J Comb., 2003

2002
Completing the spectrum of 2-chromatic S(2, 4, v).
Discret. Math., 2002

On Large Sets of v-1 L-Intersecting Steiner Triple Systems of Order v.
Des. Codes Cryptogr., 2002

Premature partial latin squares.
Ars Comb., 2002

2001
Colouring Steiner systems with specified block colour patterns.
Discret. Math., 2001

Imbalance in tournament designs.
Australas. J Comb., 2001

2000
Symmetric Graph Designs.
Graphs Comb., 2000

Three-line chromatic indices of Steiner triple systems.
Australas. J Comb., 2000

1999
Bicoloring Steiner Triple Systems.
Electron. J. Comb., 1999

Monogamous decompositions of complete bipartite graphs, symmetric H-squares, and self-orthogonal 1-factorizations.
Australas. J Comb., 1999

1998
On the 2-parallel chromatic index of Steiner triple systems.
Australas. J Comb., 1998

1997
Triangles in 2-factorizations.
J. Graph Theory, 1997

Orthogonal Double Covers of Complete Graphs by Trees.
Graphs Comb., 1997

Large Sets of Mutually Almost Disjoint Steiner Triple Systems Not From Steiner Quadruple Systems.
Des. Codes Cryptogr., 1997

Maximal Orthogonal Latin Rectangles.
Ars Comb., 1997

1996
The Existence of Selfcomplementary Circulant Graphs.
Eur. J. Comb., 1996

An invariant for one-factorizations of the complete graph.
Ars Comb., 1996

1995
Bipartite labelings of trees and the gracesize.
J. Graph Theory, 1995

Orthogonal resolutions of triple systems.
Australas. J Comb., 1995

1994
Anti-mitre steiner triple systems.
Graphs Comb., 1994

Packing pentagons into complete graphs: how clumsy can you get?
Discret. Math., 1994

Maximal sets of triangle- factors.
Australas. J Comb., 1994

1993
Maximal Sets of 2-Factors and Hamiltonian Cycles.
J. Comb. Theory, Ser. B, 1993

The Spectrum of Maximal Partial Steiner Triple Systems.
Des. Codes Cryptogr., 1993

1992
Halving Steiner triple systems.
Discret. Math., 1992

On a class of completable partial edge-colourings.
Discret. Appl. Math., 1992

1991
Partitioning Steiner triple systems into complete arcs.
Discret. Math., 1991

The fine structure of threefold triple systems: u = 1 or 3 (mod 6).
Discret. Math., 1991

Preface.
Discret. Math., 1991

Leaves, excesses and neighbourhoods in triple systems.
Australas. J Comb., 1991

1990
Repeated edges in 2-factorizations.
J. Graph Theory, 1990

1989
Hybrid triple systems and cubic feedback sets.
Graphs Comb., 1989

Cyclic Steiner Triple Systems with Cyclic Subsystems.
Eur. J. Comb., 1989

On the (15, 5, lambda)-family of BIBDs.
Discret. Math., 1989

On Alspach's conjecture.
Discret. Math., 1989

1988
The strong chromatic number of partial triple systems.
Discret. Appl. Math., 1988

1987
Repeated blocks in indecomposable twofold triple systems.
Discret. Math., 1987

1986
The number of repeated blocks in twofold triple systems.
J. Comb. Theory, Ser. A, 1986

Quadratic leaves of maximal partial triple systems.
Graphs Comb., 1986

1985
One-factorizations of the complete graph - A survey.
J. Graph Theory, 1985

A New Strongly Regular Graph.
J. Comb. Theory, Ser. A, 1985

Cyclic One-Factorization of the Complete Graph.
Eur. J. Comb., 1985

1983
Completing small partial triple systems.
Discret. Math., 1983

1982
Premature sets of 1-factors or how not to schedule round robin tournaments.
Discret. Appl. Math., 1982

1981
Steiner triple systems with rotational automorphisms.
Discret. Math., 1981

1980
2-Chromatic Steiner Quadruple Systems.
Eur. J. Comb., 1980

1979
On a variation of the Oberwolfach problem.
Discret. Math., 1979

1978
Steiner quadruple systems - a survey.
Discret. Math., 1978

1977
A Partial Room Square Can be Embedded in a Room Square.
J. Comb. Theory, Ser. A, 1977

1976
Steiner Quadruple Systems All of Whose Derived Steiner Triple Systems Are Nonisomorphic.
J. Comb. Theory, Ser. A, 1976

1975
A Theorem on the Maximum Number of Disjoint Steiner Triple Systems.
J. Comb. Theory, Ser. A, 1975

Another class of balanced graph designs: balanced circuit designs.
Discret. Math., 1975

Finite embedding theorems for partial Steiner triple systems.
Discret. Math., 1975

1974
On the Falsity of a Conjecture on Orthogonal Steiner Triple Systems.
J. Comb. Theory, Ser. A, 1974

1972
On reverse Steiner triple systems.
Discret. Math., 1972

Graph decompositions, handcuffed prisoners and balanced P-designs.
Discret. Math., 1972


  Loading...