The disjoint -flower intersection problem for Latin squares.
Lefevre, James G.; McCourt, Thomas A.
The Electronic Journal of Combinatorics [electronic only] (2011)
- Volume: 18, Issue: 1, page Research Paper P42, 33 p., electronic only-Research Paper P42, 33 p., electronic only
- ISSN: 1077-8926
Access Full Article
top
How to cite
topLefevre, James G., and McCourt, Thomas A.. "The disjoint -flower intersection problem for Latin squares.." The Electronic Journal of Combinatorics [electronic only] 18.1 (2011): Research Paper P42, 33 p., electronic only-Research Paper P42, 33 p., electronic only. <http://eudml.org/doc/230342>.
@article{Lefevre2011,
author = {Lefevre, James G., McCourt, Thomas A.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {latin square; m-flower; intersection problem},
language = {eng},
number = {1},
pages = {Research Paper P42, 33 p., electronic only-Research Paper P42, 33 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {The disjoint -flower intersection problem for Latin squares.},
url = {http://eudml.org/doc/230342},
volume = {18},
year = {2011},
}
TY - JOUR
AU - Lefevre, James G.
AU - McCourt, Thomas A.
TI - The disjoint -flower intersection problem for Latin squares.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2011
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 18
IS - 1
SP - Research Paper P42, 33 p., electronic only
EP - Research Paper P42, 33 p., electronic only
LA - eng
KW - latin square; m-flower; intersection problem
UR - http://eudml.org/doc/230342
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.