List partitions of chordal graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2976, Issue , 2004, Pages 100-108

  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

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

ARBITRARY SETS; FORBIDDEN SUBGRAPH CHARACTERIZATIONS; GRAPH COLORINGS; INDEPENDENT SET; NATURAL GENERALIZATION; PARTITION PROBLEM; POLYNOMIAL-TIME; SYMMETRIC MATRICES;

GRAPHIC METHODS;

EID: 27844607397     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24698-5_14     Document Type: Article

References (11)

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. K. Cameron, E. M. Eschen, C. T. Hoang, and R. Sritharan, The list partition problem for graphs, SODA 2004.
3. M. Chudnovsky, N. Robertson, P. Seymour, and R. Thomas, The strong perfect graph theorem, manuscript, 2002.
4. C. M. H. de Figueiredo, S. Klein, Y. Kohayakawa, and B. A. Reed, Finding skew partitions efficiently, Journal of Algorithms 37 (2000) 505-521.
5. J. Diaz, M. Serna, and D. M. Thilikos, The complexity of parametrized H-colorings: a survey, Dimacs Series in Discrete Mathematics, 2003.
6. T. Feder and P. Hell, List constraint satisfaction and list partition, submitted to SIAM J. Comput. (2003).
7. T. Feder, P. Hell, and J. Huang, List homomorphisms and circular arc graphs, Combinatorica 19 (1999) 487-505.
8. T. Feder, P. Hell, S. Klein, and R. Motwani, Complexity of list partitions, Proc. 31st Ann. ACM Symp. on Theory of Computing (1999) 464-472. SIAM J. Comput., in press.
9. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
10. P. Hell, S. Klein, L.T. Nogueira, F. Protti, Partitioning chordal graphs into independent sets and cliques, Discrete Applied Math., to appear.
11. A. Proskurowski and S. Arnborg, Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Applied Math. 1989 (23) 11-24.