A tight minimum-degree condition guaranteeing that every \(\{C_5,C_7,C_9,C_{11}\}\)-free graph is 3-colorable (Q7326071)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8252648
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight minimum-degree condition guaranteeing that every \(\{C_5,C_7,C_9,C_{11}\}\)-free graph is 3-colorable |
scientific article; zbMATH DE number 8252648 |
Statements
A tight minimum-degree condition guaranteeing that every \(\{C_5,C_7,C_9,C_{11}\}\)-free graph is 3-colorable (English)
0 references
8 September 2026
0 references
0 references
