On algorithms for (\(P_5\), gem)-free graphs (Q817767)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On algorithms for (\(P_5\), gem)-free graphs |
scientific article; zbMATH DE number 5013290
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On algorithms for (\(P_5\), gem)-free graphs |
scientific article; zbMATH DE number 5013290 |
Statements
On algorithms for (\(P_5\), gem)-free graphs (English)
0 references
20 March 2006
0 references
(\(P_{5}\), gem)-free graphs
0 references
recognition algorithms
0 references
modular decomposition
0 references
independent set
0 references
clique
0 references
coloring
0 references
clique cover
0 references
