Abstract
A family of ladder graphs, used by Youngs in his work on the Heawood conjecture, is used to provide constructions of Skolem and related triple systems, triangular biembeddings of certain complete graphs, and genus embeddings of certain complete multipartite graphs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anderson, I.,Infinite families of biembedding numbers. J. Graph Theory3 (1979), 263–268.
Anderson, I.,On the toroidal thickness of graphs. J. Graph Theory6 (1982), 177–184.
Anderson, I. andCook, R. J.,Biembeddings of graphs. Glasgow Math. J.15 (1974), 162–165.
Anderson, I. andWhite, A. T.,Current graphs and biembeddings. J. Graph Theory2 (1978), 231–239.
Davies, R. O.,On Langford's problem (II). Math. Gaz.43 (1959), 253–255.
Garman, B. L., Ringeisen, R. D. andWhite, A. T.,On the genus of strong tensor products of graphs. Canad. J. Math.28 (1976), 523–532.
Hanani, H.,A note on Steiner triple systems. Math. Scand.8 (1960), 154–156.
Heffter, L., Über Tripelsysteme. Math. Ann.49 (1897), 101–112.
Hilton, A. J. W.,On Steiner and similar triple systems. Math. Scand.24 (1969), 208–216.
Langford, C. D.,Problem. Math. Gaz.42 (1958), 228.
O'Keefe, E. S.,Verification of a conjecture of Th. Skolem. Math. Scand.9 (1961), 80–82.
Peltesohn, R., Eine Lösung der beiden Heffterschen Differenzenprobleme. Compositio Math.6 (1939), 251–257.
Ringel, G., Über das Problem der Nachbargebiete auf orientierbaren Flächen. Abh. Math. Sem. Univ. Hamburg25 (1961), 105–127.
Ringel, G., Die Toroidale Dicke des vollständigen Graphen. Math. Z.87 (1965), 19–26.
Rogers, D.,Notes on harmonious graphs. Unpublished.
Rosa, A.,On reverse Steiner triple systems. Discrete Math.2 (1972), 61–71.
Rosa, A., Poznamka o cyklickych Steinerovych systemoch trojic. Math.-Fyz. Časopis Sloven. Akad. Vied.16 (1966), 285–290.
Skolem, T.,On certain distributions of integers in pairs with given differences. Math. Scand.5 (1957), 273–280.
Skolem, T.,Some remarks on the triple systems of Steiner. Math. Scand.6 (1958), 273–280.
Stanton, R. G. andGoulden, I. P.,Graph factorization, general triple systems and cyclic triple systems. Aequationes Math.22 (1981), 1–28.
Youngs, J. W. T.,The Heawood map-coloring problem: cases 1, 7and 10. J. Combinatorial Theory8 (1970), 220–231.
Youngs, J. W. T.,The mystery of the Heawood conjecture. InGraph Theory and Its Applications, edited by B. Harris, Academic Press, New York, 1970.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Anderson, I. Triples, current graphs and biembeddings. Aeq. Math. 24, 230–242 (1982). https://doi.org/10.1007/BF02193046
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02193046