A lower bound for the one-chromatic number of a surface (Q1328382): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/jctb.1994.1028 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2002779087 / rank | |||
Normal rank |
Latest revision as of 19:51, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A lower bound for the one-chromatic number of a surface |
scientific article |
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