The maximum k-colorable subgraph problem for chordal graphs (Q1108038)
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 4066364
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum k-colorable subgraph problem for chordal graphs |
scientific article; zbMATH DE number 4066364 |
Statements
The maximum k-colorable subgraph problem for chordal graphs (English)
0 references
1987
0 references
NP-complete
0 references
k-colorable
0 references
chordal graphs
0 references
0 references
0.8111255168914795
0 references
0.8013647198677063
0 references
0.7982589602470398
0 references
0.7942132949829102
0 references
