Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7 (Q2028085)
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: Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7 |
scientific article; zbMATH DE number 7352775
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7 |
scientific article; zbMATH DE number 7352775 |
Statements
Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7 (English)
0 references
31 May 2021
0 references
algorithms
0 references
complexity
0 references
proper coloring
0 references
0.841522216796875
0 references
0.7904064655303955
0 references
0.7904064655303955
0 references
0.7896308302879333
0 references
0.7896308302879333
0 references
