Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four (Q831869)
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: Dichotomizing k-vertex-critical H-free graphs for H of order four |
scientific article; zbMATH DE number 7497780
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four |
scientific article; zbMATH DE number 7497780 |
Statements
Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four (English)
0 references
24 March 2022
0 references
graph coloring
0 references
certifying algorithms
0 references
0.8770055770874023
0 references
0.8752850890159607
0 references
0.8746910691261292
0 references
0.8741182684898376
0 references
0.8701939582824707
0 references
