Completing partial Latin squares with two filled rows and two filled columns.
Adams, Peter, Bryant, Darryn, Buchanan, Melinda (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Decomposing complete tripartite graphs into closed trails of arbitrary lengths”
Completing partial Latin squares with two filled rows and two filled columns.
Latin squares with forbidden entries.
Cutler, Jonathan, Öhman, Lars-Daniel (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cells and constructible representations in type .
Pietraho, Thomas (2008)
The New York Journal of Mathematics [electronic only]
Similarity:
The complexity of constructing gerechte designs.
Vaughan, E.R. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Negative control of cell proliferation. Growth arrest versus apoptosis. Role of GBP.
Mallucci, Livio, Wells, Valerie (1998)
Journal of Theoretical Medicine
Similarity:
Formation of vertebral precursors: Past models and future predictions.
Baker, Ruth E., Schnell, Santiago, Maini, Philip K. (2003)
Journal of Theoretical Medicine
Similarity:
-partition boards and poly-Stirling numbers.
Miceli, Brian K. (2010)
Journal of Integer Sequences [electronic only]
Similarity:
Lyndon words and transition matrices between elementary, homogeneous and monomial symmetric functions.
Kulikauskas, Andrius, Remme, Jeffrey (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Alspach's problem: The case of Hamilton cycles and 5-cycles.
Jordon, Heather (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
When is an Incomplete 3 × n Latin Rectangle Completable?
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.
Some gregarious cycle decompositions of complete equipartite graphs.
Smith, Benjamin R. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: