Compositions for perfect graphs (Q2266722)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3895115
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Compositions for perfect graphs |
scientific article; zbMATH DE number 3895115 |
Statements
Compositions for perfect graphs (English)
0 references
1985
0 references
In this paper we introduce a new graph composition, called 2-amalgam, and we prove that the 2-amalgam of perfect graphs is perfect. This composition generalizes many of the operations known to preserve perfection, such as the clique identification, substitution, join and amalgam operations. We give polynomial-time algorithms to determine whether a general graph is decomposable with respect to the 2-amalgam or amalgam operations.
0 references
perfect graphs
0 references
graph decomposition
0 references
graph composition
0 references
2-amalgam
0 references
algorithms
0 references
0.8952589631080627
0 references
0.8148353695869446
0 references
0.7936347126960754
0 references
0.7845826148986816
0 references
