Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide (Q5229535)
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: Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide |
scientific article; zbMATH DE number 7094891
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide |
scientific article; zbMATH DE number 7094891 |
Statements
Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide (English)
0 references
15 August 2019
0 references
coloring
0 references
hereditary graph class
0 references
self-complementary subgraph
0 references
0.94056374
0 references
0.94056374
0 references
0.9195158
0 references
0 references
0.9134112
0 references
0.91298294
0 references
0.91100585
0 references
0 references
