A 4-color theorem of the Klein bottle (Q1825877): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(89)90324-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2094144772 / rank | |||
Normal rank | |||
Latest revision as of 09:53, 30 July 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
