Finding Skew Partitions Efficiently

Journal of Algorithms

Volumn 37, Issue 2, 2000, Pages 505-521

  De Figueiredo, Celina M H ^a   Klein, Sulamita ^a   Kohayakawa, Yoshiharu ^b   Reed, Bruce A ^c  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

^c CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0006798281     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1999.1122     Document Type: Article

References (17)

1. N. Alon and M. Tarsi, Colorings and orientations of graphs, Combinatorica 12 (1992), 125-134.
2. C. Berge, Les problèmes de coloration en théorie des graphes, Publ. Inst. Stat. Univ. Paris 9 (1960), 123-160.
3. V. Chvátal, Recognizing decomposable graphs, J. Graph Theory 8 (1984) 51-53.
4. V. Chvátal, Star-cutsets and perfect graphs, J. Combin. Theory Ser. B 39 (1985), 189-199.
5. G. Cornuéjols and B. Reed, Complete multi-partite cutsets in minimal imperfect graphs, J. Combin. Theory Ser. B 59 (1993), 191-198.
6. Problem session on minimal imperfect graphs, in "DIMACS Workshop on Perfect Graphs," (V. Chvátal and L. Lovász, Organizers), Princeton University, NJ, June 1993.
7. H. Everett, S. Klein, and B. Reed, An optimal algorithm for finding clique-cross partitions, Congr. Numer. 135 (1998), 171-177.
8. T. Feder and P. Hell, List homomorphisms to reflexive graphs, J. Combin. Theory Ser. B 72 (1998), 236-250.
9. T. Feder, P. Hell, and J. Huang, List homomorphisms and circular arc graphs, Combinatorica 19 (1999), 487-505.
10. T. Feder, P. Hell, S. Klein, and R. Motwani, Complexity of graph partition problems, in "Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing," pp. 464-472, 1999.
11. H. Fleischner and M. Stiebitz, A solution of a coloring problem of P. Erdos, Discrete Math. 101 (1992), 39-48.
12. P. Hell and J. Nešetřil, On the complexity of H-coloring, J. Combin. Theory Ser. B 48 (1990), 92-110.
13. C. T. Hoàng, Some properties of minimal imperfect graphs, Discrete Math. 160 (1996), 165-175.
14. D. S. Johnson, The NP-completeness column: an ongoing guide, J. Algorithms 6 (1985), 434-451.
15. G. MacGillivray and M. L. Yu, Generalized partitions of graphs, Discrete Appl. Math. 91 (1999), 143-153.
16. S. Klein and C. M. H. de Figueiredo, The NP-completeness of multipartite cutset testing, Congr. Numer. 119 (1996), 216-222.
17. N. Vikas, Computational complexity of graph compaction, in "Proceedings of the Tenth ACM-SIAM Symposium on Discrete Algorithms," pp. 977-978, 1999.