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”

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.