Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide (Q5229535): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1607.06757 / rank | |||
Normal rank | |||
Latest revision as of 00:05, 20 April 2024
scientific article; zbMATH DE number 7094891
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
