A lower bound for the one-chromatic number of a surface (Q1328382)
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 599859
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound for the one-chromatic number of a surface |
scientific article; zbMATH DE number 599859 |
Statements
A lower bound for the one-chromatic number of a surface (English)
0 references
10 October 1994
0 references
Let \(\chi_ 1(S)\) be the maximum chromatic number for all graphs which can be drawn on a surface \(S\) so that each edge is crossed by no more than one other edge. It is proved that \(F(S)-34\leq\chi_ 1(S)\), where \(F(S)=\lfloor{1\over 2}(9+\sqrt{81-32E(S)})\rfloor\) is Ringel's upper bound for \(\chi_ 1(S)\) and \(E(S)\) is the Euler characteristic of \(S\).
0 references
chromatic number
0 references
surface
0 references
upper bound
0 references
Euler characteristic
0 references
0.9546936
0 references
0.8895912
0 references
0.8832735
0 references
0 references
0.8785974
0 references
0 references
0.8763844
0 references
0.87594944
0 references
