List partitions

SIAM Journal on Discrete Mathematics

Volumn 16, Issue 3, 2003, Pages 449-478

  Feder, Tomas ^d   Hell, Pavol ^a   Klein, Sulamita ^b   Motwani, Rajeev ^c  

^a SIMON FRASER UNIVERSITY   (Canada)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^c Stanford University   (United States)

^d NONE

Author keywords

2 joins, communication bound; Clique cutsets; Constraint satisfaction problems; Dichtomy; Graph partitions; H colorings; List homomorphisms; NP completeness; Perfect graphs; Polynomial time algorithms; Quasi polynomial algorithms; Skew cutsets; Split graphs

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

CLIQUE CUTSETS; CONSTRAINT SATISFACTION PROBLEMS; DICHOTOMY; GRAPH PARTITIONS; LIST HOMOMORPHISMS; PERFECT GRAPHS; POLYNOMIAL TIME ALGORITHMS; QUASI-POLYNOMIAL ALGORITHMS; SKEW CUTSETS; SPLIT GRAPHS;

GRAPH THEORY;

EID: 0041384097     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480100384055     Document Type: Article

References (48)

1. N. Alon and M. Tarsi, Colorings and orientations of graphs, Combinatorica, 12 (1992), pp. 125-134.
2. B. Aspvall, F. Plass, and R.E. Tarjan, A linear time algorithm for testing the truth of certain quantified Boolean formulas, Inform. Process. Lett., 8 (1979), pp. 121-123.
3. C. Berge, Farbung von Graphen deren samtliche bzw. deren ungerade Kreise starr sind (Zusammenfassung), Wiss. Zeit. der Martin-Luther Universitat Halle-Wittenberg Math. Natur. Reihe, 10 (1961), pp. 114-115.
4. R.E. Bixby, A composition for perfect graphs, Ann. Discrete Math., 21 (1984), pp. 221-224.
5. A. Brandstädt, Partitions of graphs into one or two independent stable sets and cliques, Discrete Math., 152 (1996), pp. 47-54.
6. A. Brandstädt, Corrigendum to Partitions of graphs into one or two independent stable sets and cliques, Discrete Math., 186 (1998), p. 295.
7. A. Brandstädt, Partitions of Graphs into One or Two Stable Sets and Cliques, Informatik-Berichte Nr. 105, 1/1991, FernUniversitat Hagen Technical Report, Hagen, Germany, 1991.
8. A. Brandstädt, V.B. Le, and T. Szymczak, The complexity of some problems related to graph 3-colourability, Discrete Appl. Math., 89 (1998), pp. 59-73.
9. M. Burlet and J. Fonlupt, A polynomial algorithm to recognize a Meyniel graph, Ann. Discrete Math., 21 (1994), pp. 225-252.
10. K. Cameron, E.M. Eschen, C.T. Hoang, and R. Sritharan, personal communication.
11. M. Conforti, G. Cornuéjols, G. Gasparyan, and Vušković, Perfect graphs, partitionable graphs and cutsets, Combinatorica, 22 (2002), pp. 19-33.
12. M. Chudnovsky, N. Robertson, P. Seymour, and R. Thomas, The Strong Perfect Graph Theorem, manuscript, 2002.
13. V. Chvátal, Star-cutsets and perfect graphs, J. Combin. Theory Ser. B, 39 (1985), pp.189-199.
14. V. Chvátal, and N. Sbihi, Bull-free Berge graphs are perfect, Graphs Combin., 3 (1987), pp. 127-139.
15. G. Cornuéjols and W.H. Cunningham, Compositions for perfect graphs, Discrete Math., 55 (1985), pp. 245-254.
16. G. Conruéjols and B. Reed, Complete multi-partite cutsets in minimal imperfect graphs, J. Combin. Theory Ser. B, 59 (1993), pp. 191-198.
17. A. Cournier and M. Habib, A new linear algorithm for modular decomposition, in CAAP'94: International Colloquium, Lecture Notes in Comput. Sci. 787, Sophie Tison, ed., Springer-Verlag, Berlin, 1994, pp. 68-84.
18. W.H. Cunningham, A Combinatorial Decomposition Theory, Ph.D. thesis, University of Waterloo, Waterloo, ON, Canada, 1973.
19. W.H. Cunningham, Decomposition of directed graphs, SIAM J. Alg. Disc. Meth., 3 (1982), pp. 214-228.
20. W.H. Cunningham and J. Edmonds, A combinatorial decomposition theory, Canad. J. Math., 32 (1980), pp. 734-765.
21. H. Everett, S. Klein, and B. Reed, An algorithm for finding clique-cross partitions. Congr. Numer., 135 (1998), pp. 171-177.
22. H. Everett, S. Klein, and B. Reed, An algorithm for finding homogeneous pairs, Discrete Appl. Math., 72 (1977), pp. 209-218.
23. T. Feder and P. Hell, List homomorphisms to reflexive graphs, J. Combin. Theory Ser. B, 72 (1998), pp. 236-250.
24. T. Feder, P. Hell, and J. Huang, List homomorphisms and circular arc graphs, Combinatorica, 19 (1999), pp. 487-505.
25. T. Feder, P. Hell, and J. Huang, Bi-arc graphs and the complexity of list homomorphisms, J. Graph Theory, 42 (2003), pp. 61-80.
26. T. Feder, P. Hell, S. Klein, and R. Motwani, Complexity of graph partition problems, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, Atlanta, GA, 1999, pp. 464-472.
27. T. Feder and M.Y. Vardi, The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory, SIAM J. Comput., 28 (1998), pp. 57-104.
28. C.M.H. de Figueiredo and S. Klein, The NP-completeness of multipartite cutset testing, Congr. Numer., 119 (1996), pp. 217-222.
29. C.M.H. de Figueiredo, S. Klein, Y. Kohayakawa, and B. Reed, Finding skew partitions efficiently, J. Algorithms, 37 (2000), pp. 505-521.
30. H. Fleischner and M. Stiebitz, A solution of a colouring problem of P. Erdos, Discrete Math., 101 (1992), pp. 39-48.
31. M.R. Garey and D.S. Johnson, Computers and Intractability, W.H. Freeman, San Francisco, 1979.
32. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
33. W. Gutjahr, E. Welzl, and G. Woeginger, Polynomial graph-colorings, Discrete Appl. Math., 35 (1992), pp. 29-45.
34. P. Hell and J. Nešetřil, On the complexity of H-colouring, J. Combin. Theory Ser. B, 48 (1990), pp. 92-110.
35. P. Hell, S. Klein, L. T. Nogueira, and F. Protti, On generalized split graphs, Electronic Notes in Discrete Mathematics, 7 (2001); available online from http://www.elsevier.nl/locate/jnlnr/05268.
36. C.T. Hoang and V.B. Le, Recognizing perfect 2-split graphs, SIAM J. Discrete Math., 13 (2000), pp. 48-55.
37. L. Lovász, Communication complexity: A survey, in Paths, Flows, and VLSI-Layout, B.Korte, L. Lovász, H. J. Prömel, and A. Schrijver, eds., Springer-Verlag, Berlin, 1990, pp. 235-265.
38. L. Lovász, Normal hypergraphs and the perfect graph conjecture, Discrete Math., 2 (1972), pp. 253-267.
39. G. MacGillivray and M.L. Yu, Generalized partitions of graphs, Discrete Appl. Math., 91 (1999), pp. 143-153.
40. R.M. McConnell and J.P. Sprinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, in Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, VA, 1994, ACM, New York, 1994, pp. 536-545.
41. L. Tito-Nogueira, personal communication.
42. R.E. Tarjan, Decomposition by clique separators, Discrete Math., 55 (1985), pp. 221-232.
43. A. Tucker, Coloring graphs with stable sets, J. Combin. Theory Ser. B, 34 (1983), pp. 258-267.
44. K. Tucker-Nally, List M-Partitions of Digraphs, M.Sc. Thesis, Simon Fraser University, Burnaby, BC, Canada, 2003.
45. N. Vikas, Computational complexity of graph compaction, in Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, 1999.
46. D.G. West, Introduction to Graph Theory, Prentice-Hall, Upper Saddle River, NJ, 1996.
47. S. Whitesides, An algorithm for finding clique cutsets, Inform. Process. Lett., 12 (1981), pp. 31-32.
48. S. Whitesides, A method for solving certain graph recognition and optimization problems, with applications to perfect graphs, Ann. Discrete Math., 21 (1984), pp. 281-297.