[BBJR] C. Barrientos, A Bernasconi, E. Jeltsch, S. Ruiz: Randomly star-decomposable graphs. Congressus Numeratium 64 (1988), 193–195. MR 0988681

[BGH] L. W. Beineke, W. Goddard, P. Hamburger: Random Packings of Graphs. Manuscript, .

[EVK] S. Even, O. Kariv: An $O(n^{2.5})$ algorithm for maximum matching in general graphs. Proc. 16th Annual Symp. on Foundation of Computer Sciences. IEEE, New York (1975), 100–112. MR 0428780

[JGT] Journal of Graph Theory 1, 9 (1985), . Zbl 1170.01303

[RU] S. Ruiz: Randomly decomposable graphs. Discrete Mathematics 57 (1985), 123–128. DOI 10.1016/0012-365X(85)90161-X | MR 0816053 | Zbl 0588.05035

[SK] D. P. Sumner: Randomly Matchable Graphs. Journal of Graph Theory 3 (1979), 183–186. DOI 10.1002/jgt.3190030209 | MR 0530304 | Zbl 0404.05053

[TAD] M. Tarsi, D. Dor: Graph Decomposition is NPC, a Complete Proof of Holyer’s Conjecture. (to appear).