论文信息 - On colored designs - II

On colored designs - II

A colored version of the H-design concept is studied. The problem of whether or not the existence of an H-design for a graph G implies the existence of the corresponding colored designs is solved for small graphs H in the cases of two and three colors.

Yair Caro | Yehuda Roditty | Johanan Schönheim

[1] MICHAEL TARSI. Decomposition of a Complete Multigraph into Simple Paths: Nonbalanced Handcuffed Designs , 1983, J. Comb. Theory, Ser. A.

[2] A. Bialostocki,et al. 3K2-decomposition of a graph , 1982 .

[3] Frank Harary,et al. Graph Theory , 2016 .

[4] Juraj Bosák. Decomposition of graphs , 1990 .

[5] Noga Alon,et al. A note on the decomposition of graphs into isomorphic matchings , 1983 .

[6] Michael Tarsi. Decomposition of complete multigraphs into stars , 1979, Discret. Math..

[7] Charles J. Colbourn,et al. Edge-coloured designs with block size four , 1988 .

[8] Frank E. Bennett,et al. Incomplete idempotent Schröder quasigroups and related packing designs , 1994 .