A 4-color theorem of the Klein bottle (Q1825877): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q175610 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Jozef Širáň / rank | |||
Normal rank |
Revision as of 06:09, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A 4-color theorem of the Klein bottle |
scientific article |
Statements
A 4-color theorem of the Klein bottle (English)
0 references
1989
0 references
It is well known that the chromatic number of a graph embeddable in the Klein bottle does not exceed 6. The author proves that if the girth g of such a graph satisfies \(4\leq g\leq 5\) or \(g\geq 6\) then the upper bound on the chromatic number is 4 or 3, respectively. These bounds are sharp for all g except, possibly, \(g=5.\)
0 references
graph embeddings
0 references
Klein bottle
0 references
chromatic number
0 references