Publications
Craig Bailey and Wayne M. Dymacek, Regular Steinhaus graphs,
Congr. Numer. 66 (1988), 45-47.
D. A. Belitskii, Some infinite series of balanced Steinhaus triangles, Metody Diskret. Analiz. No. 51 (1991), no. 3-6, 112.
Neal Brand, Almost all Steinhaus graphs have diameter 2, J. Graph Theory 16 (1992), no. 3, 213-219.
Neal Brand, Stephen Curran, Sajal Das, and Tom Jacob, Probability of diameter two for Steinhaus graphs, Discrete Appl. Math. 41 (1993), 165-171.
Neal Brand and Steve Jackson, Properties of classes of random graphs, Combin. Probab. Comput. 3 (1994), no 4, 435-454.
Neal Brand and Margaret Morton, Uniform generalized Steinhaus graphs, preprint.
Neal Brand and Margaret Morton, Generalized Steinhaus graphs, J.
Graph Theory 20 (1995), no. 1, 47-58.
Robert C. Brigham, Julie R. Carrington and Ronald D. Dutton, Embedding
in Steinhaus graphs, J. Combin. Inform. System Sci. 17 (1992), no. 1-2, 257-270.
Robert C. Brigham and Ronald D. Dutton, Distances and diameters in
Steinhaus graphs, Cong. Numer. 76 (1990), 7-14.
Gerald J. Chang, Binary triangles, Bull. Inst. Math. Acad. Sinica
11 (1983), no. 2, 209-225.
Bhaskar DasGupta and Martin Fürer, Bipartite Steinhaus
graphs, preprint.
Wayne M. Dymacek, Cut-vertices and cut-sets of size 2 in Steinhaus graphs, in preparation.
Wayne M. Dymacek, Steinhaus graphs, Congr. Numer. XXIII (1979), 339-412.
Wayne M. Dymacek, Complements of Steinhaus graphs, Discrete Math 37 (1981), no. 2-3, 167-180.
Wayne M. Dymacek, Bipartite Steinhaus graphs, Discrete Math. 59
(1986), no. 1-2, 9-20.
Wayne M. Dymacek, Steinhaus tournaments, Congr. Numer. 53 (1986), 221-233.
Wayne M. Dymacek, Small cycles in Steinhaus graphs, Congr. Numer.
70 (1990), 41-52.
Wayne M. Dymacek, Matthew Koerlin, Jean Guy D. Speton, Tom Whaley, and
Jennifer Yanulavich, Disconnected complements of Steinhaus graphs,
in preparation.
Wayne M. Dymacek and Tom Whaley, Steinhaus graphs as a source of bit-wise projects, Journal of Computing in Small Colleges (1992).
Wayne M. Dymacek and Tom Whaley, Generating strings for bipartite Steinhaus graphs, Discrete Math. 141 (1995), 95-107.
Heiko Harborth, Solution of Steinhaus's problem with plus and minus signs, J. Combin. Theory Ser. A 12 (1972), 253-259.
Heiko Harborth, Aufgabe 785, Elem. Math. 33 (1978), 49-50, solution by O.P. Lossers.
Yueh-Shin Lee and Gerard J. Chang, Counting bipartite Steinhaus graphs, preprint.
J.C. Molluzzo, Steinhaus graphs, theory and Applications of Graphs (Kalamazoo, Michigan, 1976) (Yousef Alavi and Don R. Lick, eds.), Lecture Notes in Math. vol. 642, Western Michigan University, Springer-Verlag, Berlin, Heidelberg, and New York, 19
78, pp. 394-402.
Jean-Guy D. Speton, Cut-vertices in Steinhaus complements, in
preparation.
Jean-Guy D. Speton, Planarity in Steinhaus graphs and Steinhaus complements, submitted.
Hugo Steinhaus, One hundred problems in elementary mathematics, Dover, New York, 1979. This is a republication of the English translation first published in 1964 by Basic Books, Inc., 10 E. 53rd St., New york, N.Y. 10022.
E.T.H. Wang, Problem E 2541, Amer. Math. Monthly 82 (1975), no. 6, 659-660, solution by Michael Joseph in same journal 83 (1976), 660-661.
Back to Steinhaus Research Main Page