论文信息 - List Partitions of Chordal Graphs

List Partitions of Chordal Graphs

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.)

Sulamita Klein | Pavol Hell | Tomás Feder | Fábio Protti | Loana Tito Nogueira

[1] Ton Kloks,et al. Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs , 1993, J. Algorithms.

[2] Stefan Arnborg,et al. Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..

[3] P. Seymour,et al. The Strong Perfect Graph Theorem , 2002, math/0212070.

[4] Pavol Hell,et al. List Homomorphisms and Circular Arc Graphs , 1999, Comb..

[5] Kathie Cameron,et al. The list partition problem for graphs , 2004, SODA '04.

[6] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .

[7] Sulamita Klein,et al. Partitioning chordal graphs into independent sets and cliques , 2004, Discret. Appl. Math..

[8] Yoshiharu Kohayakawa,et al. Finding Skew Partitions Efficiently , 2000, J. Algorithms.

[9] Yoshiharu Kohayakawa,et al. Finding Skew Partitions Efficiently , 2000, J. Algorithms.