1 citations · 1 across the 4 of their papers we have counts for
9 papers
A simple proof for the chromatic number of cyclic Latin squares of even order
Zahra Naghdabadi
The chromatic number of a cyclic Latin square of order 2n is 2n+2. The available proof for this statement includes a coloring that is rather lengthy. Here, we introduce a coloring…
Block-avoiding point sequencings of Mendelsohn triple systems
Donald L. Kreher, Douglas R. Stinson, Shannon Veitch
A cyclic ordering of the points in a Mendelsohn triple system of order (or MTS) is called a sequencing. A sequencing is -good if there does not exist a triple $(…
Good sequencings for small Mendelsohn triple systems
Donald L. Kreher, Douglas R. Stinson, Shannon Veitch
A Mendelsohn triple system of order (or MTS) is a decomposition of the complete graph into directed 3-cyles. We denote the directed 3-cycle with edges , and…
Block-avoiding point sequencings of directed triple systems
Donald L. Kreher, Douglas R. Stinson, Shannon Veitch
A directed triple system of order (or, DTS) is decomposition of the complete directed graph into transitive triples. A -good sequencing of a DTS is a p…
Sequencing Partial Steiner Triple Systems
Brian Alspach, Donald L. Kreher, Adrián Pastine
A partial Steiner triple system of order n is sequenceable if there is a sequence of length n of its distinct points such that no proper segment of the sequence is a union of point…
Good sequencings for small directed triple systems
Donald L. Kreher, Douglas R. Stinson, Shannon Veitch
A directed triple system of order (or, DTS) is a decomposition of the complete directed graph into transitive triples. An -good sequencing of a DTS…