Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Cameron, Peter J.
1977.
Higher Combinatorics.
p.
217.
Fiorini, S.
1978.
A bibliographic survey of edge‐colorings.
Journal of Graph Theory,
Vol. 2,
Issue. 2,
p.
93.
Drake, David A.
1979.
Partial λ-Geometries and Generalized Hadamard Matrices Over Groups.
Canadian Journal of Mathematics,
Vol. 31,
Issue. 3,
p.
617.
Di Paola, J. W.
and
Nemeth, E.
1979.
APPLICATIONS OF PARALLELISMS.
Annals of the New York Academy of Sciences,
Vol. 319,
Issue. 1,
p.
153.
Robinson, R. W.
1979.
Combinatorial Mathematics VI.
Vol. 748,
Issue. ,
p.
127.
Biggs, N. L.
and
Ito, T.
1980.
Graphs with even girth and small excess.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 88,
Issue. 1,
p.
1.
Beth, Thomas
and
Jungnickel, Dieter
1981.
Geometries and Groups.
Vol. 893,
Issue. ,
p.
157.
Hauck, Peter
1982.
Eine charakterisierung des steinersystems S(5, 8, 24).
Journal of Combinatorial Theory, Series A,
Vol. 32,
Issue. 1,
p.
99.
Brouwer, A.
1983.
On the uniqueness of a certain thin near octagon (or partial 2-geometry, or parallelism) derived from the binary Golay code.
IEEE Transactions on Information Theory,
Vol. 29,
Issue. 3,
p.
370.
Cron, N. J.
and
Mavron, V. C.
1983.
On intersections of symmetric subdesigns of symmetric designs.
Archiv der Mathematik,
Vol. 40,
Issue. 1,
p.
475.
Drake, David A
and
Larson, Jean A
1983.
Pairwise balanced designs whose line sizes do not divide six.
Journal of Combinatorial Theory, Series A,
Vol. 34,
Issue. 3,
p.
266.
Colbourn, Charles J.
Colbourn, Marlene J.
and
Rosa, Alexander
1985.
Indecomposable 1-factorizations of the complete multigraph.
Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics,
Vol. 39,
Issue. 3,
p.
334.
Mendelsohn, Eric
and
Rosa, Alexander
1985.
One‐factorizations of the complete graph—A survey.
Journal of Graph Theory,
Vol. 9,
Issue. 1,
p.
43.
Harary, Frank
and
Robinson, Robert W.
1985.
Isomorphic factorizations X: Unsolved problems.
Journal of Graph Theory,
Vol. 9,
Issue. 1,
p.
67.
Beutelspacher, Albrecht
and
Ganter, Bernhard
1986.
Zur Vervollst�ndigung von Dreiecksr�umen.
Archiv der Mathematik,
Vol. 47,
Issue. 2,
p.
182.
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.
Yoshizawa, Mitsuo
1989.
On multiply transitive locally finite permutation groups.
Archiv der Mathematik,
Vol. 53,
Issue. 5,
p.
417.
Brouwer, A.E.
Shearer, J.B.
Sloane, N.J.A.
and
Smith, W.D.
1990.
A new table of constant weight codes.
IEEE Transactions on Information Theory,
Vol. 36,
Issue. 6,
p.
1334.
Beth, Thomas
and
Hatz, Volker
1991.
A restricted crossbar implementation and its applications.
ACM SIGARCH Computer Architecture News,
Vol. 19,
Issue. 6,
p.
12.
Noda, Ryuzaburo
1991.
An inequality for steiner systems.
Graphs and Combinatorics,
Vol. 7,
Issue. 3,
p.
277.