Escher's combinatorial patterns.
Schattscheider, Doris (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Schattscheider, Doris (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Konvalinka, Matjaž (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chinn, Phyllism, Grimaldi, Ralph, Heubach, Silvia (2007)
Journal of Integer Sequences [electronic only]
Similarity:
A. Bonisoli, M. Deza (1983)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Shelley L. Rasmussen (2011)
Visual Mathematics
Similarity:
Yan, Jie, Wang, Chengmin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Le, Ian (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Paulus Gerdes (2013)
Visual Mathematics
Similarity:
Reinhardt Euler, Paweł Oleksik (2013)
Discussiones Mathematicae Graph Theory
Similarity:
We use the concept of an availability matrix, introduced in Euler [7], to describe the family of all minimal incomplete 3 × n latin rectangles that are not completable. We also present a complete description of minimal incomplete such latin squares of order 4.
Benjamin, Arthur T., Eustis, Alex K., Plott, Sean S. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Topalova, Svetlana, Zhelezova, Stela (2013)
Serdica Journal of Computing
Similarity:
Resolutions which are orthogonal to at least one other resolution (RORs) and sets of m mutually orthogonal resolutions (m-MORs) of 2-(v, k, λ) designs are considered. A dependence of the number of nonisomorphic RORs and m-MORs of multiple designs on the number of inequivalent sets of v/k − 1 mutually orthogonal latin squares (MOLS) of size m is obtained. ACM Computing Classification System (1998): G.2.1. ∗ This work was partially supported by the Bulgarian National Science...
Mavron, V.C. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity: