4-Chromatic Graphs Have At Least 4 Cycles of Length $0 \bmod 3$ (Q6462935)
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 4 Cycles of Length $0 \bmod 3$ |
scientific article; zbMATH DE number 902381325
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 4-Chromatic Graphs Have At Least 4 Cycles of Length $0 \bmod 3$ |
scientific article; zbMATH DE number 902381325 |
Statements
10 December 2023
0 references
math.CO
0 references
cs.DM
0 references
