Maximum \(h\)-colourable subgraph problem in balanced graphs (Q293269)
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: Maximum h-colourable subgraph problem in balanced graphs |
scientific article; zbMATH DE number 6590704
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum \(h\)-colourable subgraph problem in balanced graphs |
scientific article; zbMATH DE number 6590704 |
Statements
Maximum \(h\)-colourable subgraph problem in balanced graphs (English)
0 references
9 June 2016
0 references
balanced graph
0 references
strongly chordal graph
0 references
balanced matrix
0 references
totally balanced matrix
0 references
\(k\)-fold clique transversal problem
0 references
maximum \(h\)-colourable subgraph problem
0 references
0.8159522414207458
0 references
0.7850139141082764
0 references
0.783983051776886
0 references
0.7763237357139587
0 references
