The List Partition Problem for Graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 384-392

  Cameron, Kathie ^a   Eschen, Elaine M ^b   Hoàng, Chính T ^a   Sritharan, R ^c  

^a WILFRID LAURIER UNIVERSITY   (Canada)

^b West Virginia University   (United States)

^c UNIVERSITY OF DAYTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LIST PARTITION PROBLEM; SKEW PARTITION; VERTICES;

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

GRAPH THEORY;

EID: 1842487554     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. B. Aspvall, F. Plass, and R. E. Tarjan, A linear time algorithm for testing the truth of certain quantified boolean formulas, Information Processing Letters, 8 (1979), 121-123.
2. A. Brandstädt, Partitions of graphs into one or two stable sets and cliques, Discrete Mathematics, 152 (1996), 47-54; Corrigendum, Discrete Mathematics, 186 (1998), 295.
3. A. Brandstädt, Partitions of graphs into one or two stable sets and cliques, Discrete Mathematics, 152 (1996), 47-54; Corrigendum, Discrete Mathematics, 186 (1998), 295.
4. A. Brandstädt, V.B. Le, and T. Szymczak, The complexity of some problems related to graph 3-colourability, Discrete Applied Mathematics, 89 (1998), 59-73.
5. M. Chudnovsky, N. Robertson, P. Seymour, and R. Thomas, The strong perfect graph theorem, Manuscript, 2002.
6. V. Chvátal, Website on perfect graph problems. http://athos.rutgers.edu/~chvatal/perfect/problems.html
7. G. M. H. de Figueiredo and S. Klein, The NPcompleteness of multipartite cutset testing, Congressus Numerantium, 119 (1996), 217-222.
8. G. M. H. de Figueiredo, S. Klein, Y. Kohayakawa, and B. A. Reed, Finding skew partitions efficiently, Journal of Algorithms, 37 (2000), 505-521.
9. T. Feder and P. Hell, List homomorphisms to reflexive graphs, Journal of Combinatorial Theory, Series B, 72 (1998), 236-250.
10. T. Feder and P. Hell, List constraint satisfaction and list partition, Manuscript, 2003.
11. T. Feder, P. Hell, and J. Huang, List homomorphisms and circular arc graphs, Combinatorica, 19 (1999), 487-505.
12. T. Feder, P. Hell, and J. Huang, Bi-arc graphs and the complexity of list homomorphisms, Journal of Graph Theory, 42 (2003), 61-80.
13. st Annual ACM Symposium on Theory of Computing, Atlanta GA, May 1999, 464-472; journal version is forthcoming.
14. T. Feder, P. Hell, and K.M. Tucker-Nally, Complexity of digraph list partitions, in preparation.
15. T. Feder and M.Y. Vardi, The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory, SIAM Journal of Computing, 28 (1998), 236-250.
16. M. R. Garey and D. S. Johnson, Computers and Intractability, W. H. Freeman and Company, San Francisco, 1979.
17. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
18. R. Hayward and B. R. Reed, Forbidding holes and antiholes, in: Ramirez Alfonsin, J. L. and B. A. Reed (eds.), Perfect Graphs. John Wiley & Sons, 2001, 113-137.
19. R. E. Tarjan, Decomposition by clique separators, Discrete Mathematics, 55 (1985), 221-232.
20. S. Whitesides, A method for solving certain graph recognition and optimization problems, with applications to perfect graphs, Annals of Discrete Mathematics, 21 (1984), 281-297.