A constraint on the biembedding of Latin squares
暂无分享,去创建一个
[1] Mike J. Grannell,et al. BIEMBEDDINGS OF LATIN SQUARES AND HAMILTONIAN DECOMPOSITIONS , 2004, Glasgow Mathematical Journal.
[2] Saul Stahl,et al. Genus embeddings for some complete tripartite graphs , 1976, Discret. Math..
[3] Prince Camille de Polignac. On a Problem in Combinations , 1866 .
[4] Mike J. Grannell,et al. Biembeddings of Latin squares of side 8 , 2007 .
[5] Mike J. Grannell,et al. Designs and topology , 2007 .
[6] Mike J. Grannell,et al. Recursive constructions for triangulations , 2002, J. Graph Theory.
[7] Jonathan L. Gross,et al. Topological Graph Theory , 1987, Handbook of Graph Theory.
[8] Clement W. H. Lam,et al. On the number of 8×8 latin squares , 1990, J. Comb. Theory, Ser. A.
[9] G. Ringel. Map Color Theorem , 1974 .
[10] C. Colbourn,et al. The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.