Abstract
In an earlier paper we gave efficient algorithms for partitioning chordal graphs into k independent sets and ell cliques. This is a natural generalization of the problem of recognizing split graphs, and is NP-complete for graphs in general, unless k ≤ 2 and ell ≤ 2. (Split graphs have k = ell = 1.)
In this paper we expand our focus and consider general M-partitions, also known as trigraph homomorphisms, for the class of chordal graphs. For each symmetric matrix M over 0, 1, *, the M-partition problem seeks a partition of the input graph into independent sets, cliques, or arbitrary sets, with some pairs of sets being required to have no edges, or to have all edges joining them, as encoded in the matrix M. Such partitions generalize graph colorings and homomorphisms, and arise frequently in the theory of graph perfection. We show that many M-partition problems that are NP-complete in general become solvable in polynomial time for chordal graphs, even in the presence of lists. On the other hand, we show that there are M-partition problems that remain NP-complete even for chordal graphs. We also discuss forbidden subgraph characterizations for the existence of M-partitions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms 21, 358–402 (1996)
Cameron, K., Eschen, E.M., Hoang, C.T., Sritharan, R.: The list partition problem for graphs. In: SODA 2004 (2004)
Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem (manuscript 2002)
de Figueiredo, C.M.H., Klein, S., Kohayakawa, Y., Reed, B.A.: Finding skew partitions efficiently. Journal of Algorithms 37, 505–521 (2000)
Diaz, J., Serna, M., Thilikos, D.M.: The complexity of parametrized Hcolorings: a survey. Dimacs Series in Discrete Mathematics (2003)
Feder, T., Hell, P.: List constraint satisfaction and list partition. Submitted to SIAM J. Comput. (2003)
Feder, T., Hell, P., Huang, J.: List homomorphisms and circular arc graphs. Combinatorica 19, 487–505 (1999)
Feder, T., Hell, P., Klein, S., Motwani, R.: Complexity of list partitions. In: Proc. 31st Ann. ACM Symp. on Theory of Computing, pp. 464–472 (1999); SIAM J. Comput. (in press)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)
Hell, P., Klein, S., Nogueira, L.T., Protti, F.: Partitioning chordal graphs into independent sets and cliques. Discrete Applied Math. (to appear)
Proskurowski, A., Arnborg, S.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Applied Math. (23), 11–24 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feder, T., Hell, P., Klein, S., Nogueira, L.T., Protti, F. (2004). List Partitions of Chordal Graphs. In: Farach-Colton, M. (eds) LATIN 2004: Theoretical Informatics. LATIN 2004. Lecture Notes in Computer Science, vol 2976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24698-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-24698-5_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21258-4
Online ISBN: 978-3-540-24698-5
eBook Packages: Springer Book Archive