Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Lindner, Charles C
and
Rosa, Alexander
1975.
On the existence of automorphism free Steiner triple systems.
Journal of Algebra,
Vol. 34,
Issue. 3,
p.
430.
Rosa, Alexander
1975.
A theorem on the maximum number of disjoint steiner triple systems.
Journal of Combinatorial Theory, Series A,
Vol. 18,
Issue. 3,
p.
305.
Mullin, R. C.
and
Wallis, W. D.
1975.
The existence of Room squares.
Aequationes Mathematicae,
Vol. 13,
Issue. 1-2,
p.
1.
Gross, Kenneth B.
and
Leonard, Philip A.
1976.
Adders for the patterned starter in nonabelian groups.
Journal of the Australian Mathematical Society,
Vol. 21,
Issue. 2,
p.
185.
Lindner, Charles C
Mendelsohn, Eric
and
Rosa, Alexander
1976.
On the number of 1-factorizations of the complete graph.
Journal of Combinatorial Theory, Series B,
Vol. 20,
Issue. 3,
p.
265.
Anderson, B. A.
Barge, M. M.
and
Morse, D.
1977.
A recursive construction of asymmetric 1-factorizations.
Aequationes Mathematicae,
Vol. 15,
Issue. 2-3,
p.
201.
Lindner, Charles C.
and
Rosa, Alexander
1978.
Steiner quadruple systems - a survey.
Discrete Mathematics,
Vol. 22,
Issue. 2,
p.
147.
Neumaier, Arnold
1979.
On transitive commutative idempotent quasigroups.
Journal of the Australian Mathematical Society,
Vol. 27,
Issue. 4,
p.
411.
Colbourn, Charles J.
and
Mendelsohn, Eric
1982.
Theory and Practice of Combinatorics - A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday.
Vol. 60,
Issue. ,
p.
65.
Mendelsohn, Eric
and
Rosa, Alexander
1985.
One‐factorizations of the complete graph—A survey.
Journal of Graph Theory,
Vol. 9,
Issue. 1,
p.
43.
Seah, E.
and
Stinson, D. R.
1988.
On the enumeration of one-factorizations of complete graphs containing prescribed automorphism groups.
Mathematics of Computation,
Vol. 50,
Issue. 182,
p.
607.
Akkari, Safwan
and
Oxley, James
1991.
Some extremal connectivity results for matroids.
Journal of Combinatorial Theory, Series B,
Vol. 52,
Issue. 2,
p.
301.
Zinoviev, V. A.
and
Zinoviev, D. V.
2006.
Classification of steiner quadruple systems of order 16 and rank 14.
Problems of Information Transmission,
Vol. 42,
Issue. 3,
p.
217.
Zinoviev, V. A.
and
Zinoviev, D. V.
2013.
Structure of steiner triple systems S(2 m − 1, 3, 2) of rank 2 m − m + 2 over $\mathbb{F}_2 $.
Problems of Information Transmission,
Vol. 49,
Issue. 3,
p.
232.
Korchmáros, Gábor
Pace, Nicola
and
Sonnino, Angelo
2018.
One-factorisations of complete graphs arising from ovals in finite planes.
Journal of Combinatorial Theory, Series A,
Vol. 160,
Issue. ,
p.
62.
Calatayud, Julia
and
Jornet, Marc
2022.
On the convergence of the mild random walk algorithm to generate random one-factorizations of complete graphs.
Journal of Discrete Mathematical Sciences and Cryptography,
Vol. 25,
Issue. 2,
p.
439.
Kim, Kijung
2024.
Domination-related parameters in middle graphs.
Discrete Mathematics, Algorithms and Applications,
Vol. 16,
Issue. 05,
Bailey, R.A.
Cameron, Peter J.
Ferreira, Dário
Ferreira, Sandra S.
and
Nunes, Célia
2024.
Designs for half-diallel experiments with commutative orthogonal block structure.
Journal of Statistical Planning and Inference,
Vol. 231,
Issue. ,
p.
106139.
Zhang, Guo-Hui
2092.
graphs, matrices, and designs.
p.
299.