A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs
Yair Caro; Juan Rojas; Sergio Ruiz
Czechoslovak Mathematical Journal (1996)
- Volume: 46, Issue: 3, page 413-419
- ISSN: 0011-4642
Access Full Article
topHow to cite
topReferences
top- Randomly star-decomposable graphs, Congressus Numeratium 64 (1988), 193–195. (1988) MR0988681
- Random Packings of Graphs, Manuscript, .
- An algorithm for maximum matching in general graphs, Proc. 16th Annual Symp. on Foundation of Computer Sciences. IEEE, New York (1975), 100–112. (1975) MR0428780
- [unknown], Journal of Graph Theory 1, 9 (1985), . (1985) Zbl1170.01303
- 10.1016/0012-365X(85)90161-X, Discrete Mathematics 57 (1985), 123–128. (1985) Zbl0588.05035MR0816053DOI10.1016/0012-365X(85)90161-X
- 10.1002/jgt.3190030209, Journal of Graph Theory 3 (1979), 183–186. (1979) Zbl0404.05053MR0530304DOI10.1002/jgt.3190030209
- Graph Decomposition is NPC, a Complete Proof of Holyer’s Conjecture, (to appear). (to appear)