4-Chromatic graphs have at least four cycles of length 0 mod 3 (Q6574399)
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: 4-Chromatic graphs have at least four cycles of length 0 mod 3 |
scientific article; zbMATH DE number 7882979
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 4-Chromatic graphs have at least four cycles of length 0 mod 3 |
scientific article; zbMATH DE number 7882979 |
Statements
4-Chromatic graphs have at least four cycles of length 0 mod 3 (English)
0 references
18 July 2024
0 references
reconfiguration
0 references
recolouring
0 references
dichotomy
0 references
circular colouring
0 references
0.7872224450111389
0 references
0.7793437242507935
0 references
0.7773703932762146
0 references
