×

Graph decompositions, handcuffed prisoners and balanced p-designs. (English) Zbl 0251.05015


MSC:

05B05 Combinatorial aspects of block designs
05C99 Graph theory
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Dudeney, H. E., Amusements in mathematics (1958), Nelson and Sons, reprinted by Dover Publ.
[2] Dudeney, H. E., 536 Puzzles and curious problems (1967), Charles Scribner’s Sons: Charles Scribner’s Sons New York · JFM 58.1008.02
[3] Hall, M., Combinatorial theory (1967), Blaisdell: Blaisdell Waltham · Zbl 0196.02401
[4] P. Hell, A. Kotzig and A. Rosa. Some results on the Oberwolfach problem (Decomposition of complete graphs into isomorphic quadratic factors), submitted to Aequationes Math.; P. Hell, A. Kotzig and A. Rosa. Some results on the Oberwolfach problem (Decomposition of complete graphs into isomorphic quadratic factors), submitted to Aequationes Math. · Zbl 0297.05141
[5] Harary, F., Graph theory (1969), Addison-Wesley: Addison-Wesley Reading, Mass. · Zbl 0797.05064
[6] Rosa, A., On certain valuations of the vertices of a graph, (Theory of Graphs, Proc. Symp. Rome (1967), Dunod: Dunod Paris), 349-355
[7] Rosa, A.; Huang, C., Complete classification of solutions to the problem of 9 prisoners, Proc. 25th Summer Meeting Canad. Math. Congr, 553-562 (1971), Thunder Bay · Zbl 0325.05017
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.