| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10334289 | Theoretical Computer Science | 2005 | 15 Pages |
Abstract
We also discuss forbidden subgraph characterizations of graphs admitting an M-partition. Such characterizations have recently been investigated for partitions of perfect graphs, and we focus on highlighting the improvements one can obtain for the class of chordal, rather than just perfect, graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti,