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 the normal view instead:
scientific article; zbMATH DE number 5013290
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9424625039100648
0 references
0.8597926497459412
0 references
0.8437374234199524
0 references
0.8335797190666199
0 references
0.8295736908912659
0 references
