| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9514548 | Electronic Notes in Discrete Mathematics | 2005 | 5 Pages |
Abstract
We introduce a new generalization of the modular decomposition called the bi-join decomposition. We characterize the completely decomposable graphs and we give a linear-time decomposition algorithm.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Fabien de Montgolfier, Michaël Rao,