List matrix partitions of chordal graphs

Theoretical Computer Science

Volumn 349, Issue 1, 2005, Pages 52-66

  Feder, Tomás ^a   Hell, Pavol ^b   Klein, Sulamita ^c   Nogueira, Loana Tito ^c   Protti, Fábio ^c  

^a Simon Fraser University ^*  (United States)

^b SIMON FRASER UNIVERSITY   (Canada)

^c FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Chordal graphs; Dichotomy; Forbidden subgraph characterizations; List homomorphisms; List colourings; Matrix partitions

Indexed keywords

EDGE DETECTION; MATRIX ALGEBRA; PROBLEM SOLVING; SET THEORY;

CHORDAL GRAPHS; DICHOTOMY; FORBIDDEN SUBGRAPH CHARACTERIZATIONS; LIST-COLOURINGS; LIST-HOMOMORPHISMS; MATRIX PARTITIONS;

GRAPH THEORY;

EID: 27844592261     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.09.030     Document Type: Conference Paper

References (27)

1. H.L. Bodlaender, and T. Kloks Efficient and constructive algorithms for the pathwidth and treewidth of graphs J. Algorithms 21 1996 358 402
2. A. Brandstädt Partitions of graphs into one or two stable sets and cliques Discrete Math. 152 1996 47 54
3. A. Brandstädt, P.L. Hammer, V.B. Le, V.V. Lozin, Bisplit graphs, DIMACS TR 2002-44.
4. K. Cameron, E.M. Eschen, C.T. Hoang, R. Sritharan, The list partition problem for graphs, SODA 2004, 2004.
5. M. Chudnovsky, N. Robertson, P. Seymour, R. Thomas, The strong perfect graph theorem, eprint arXiv:math/0212070.
6. V. Chvátal Star-cutsets and perfect graphs J. Combin. Theory B 39 1985 189 199
7. C.M.H. de Figueiredo, S. Klein, Y. Kohayakawa, and B.A. Reed Finding skew partitions efficiently J. Algorithms 37 2000 505 521
8. J. Diaz, M. Serna, D.M. Thilikos, Recent results on parametrized H -colourings, in: J. Nešetřil, P. Winkler (Eds.), DIMACS series in Discrete Mathematics and Theoretical Computer Science, Vol. 63, pp. 65-85, American Math. Society, 2004.
9. T. Feder, P. Hell, Full constraint satisfaction problems, manuscript.
10. T. Feder, P. Hell, Matrix partitions of perfect graphs, Special Issue of Discrete Math., in Memory of Claude Berge, 2005.
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 J. Graph Theory 42 2003 61 80
13. T. Feder, P. Hell, S. Klein, and R. Motwani Complexity of list partitions Proc. 31st Annu. ACM Symp. on Theory of Computing 1999 464 472
14. T. Feder, P. Hell, S. Klein, and R. Motwani List partitions SIAM J. Discrete Math. 16 2003 449 478
15. T. Feder, P. Hell, S. Klein, L. Tito Nogueira, F. Protti, List matrix partitions of chordal graphs, LATIN 2004, Lecture Notes in Computer Science, Vol. 2976, 2004, pp. 100-108.
16. T. Feder, P. Hell, S. Klein, L. Tito Nogueira, F. Protti, Chordal obstructions to M -partitions, manuscript. www.cs.sfu.ca/ ∼ pavol/chordalOBST.ps.
17. T. Feder, P. Hell, D. Král', J. Sgall, Two algorithms for general list matrix partitions, SODA 2005, 2005.
18. T. Feder, P. Hell, K.M. Tucker-Nally, Digraph matrix partitions and trigraph homomorphisms, manuscript.
19. M.C. Golumbic Algorithmic Graph Theory and Perfect Graphs 1980 Academic Press New York
20. P. Hell, S. Klein, L.T. Nogueira, and F. Protti Partitioning chordal graphs into independent sets and cliques Discrete Appl. Math. 141 2004 185 194
21. P. Hell, S. Klein, L.T. Nogueira, and F. Protti Packing r -cliques in weighted chordal graphs Ann. Oper. Res. 138 2005 179 187
22. P. Hell, and J. Nešetřil Graphs and Homomorphisms 2004 Oxford University Press Oxford
23. R.M. McConnel, and J.P. Spinrad Linear time modular decomposition and efficient transitive orientation of comparability graphs Proc. ACM-SIAM Symp. on Discrete Algorithms 1994 536 545
24. A. Proskurowski, S. Arnborg, Linear time algorithms for NP-hard problems restricted to partial k -trees, Discrete Appl. Math. (23) (1989) 11-24.
25. R.E. Tarjan Decomposition by clique separators Discrete Math. 55 1985 221 232
26. A. Tucker Coloring graphs with stable sets J. Combin. Theory Ser. B 34 1983 258 267
27. S. Whitesides An algorithm for finding clique cutsets Inform. Process. Lett. 12 1981 31 32