Cycle lengths and chromatic number of graphs (Q1883263)
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 2105621
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cycle lengths and chromatic number of graphs |
scientific article; zbMATH DE number 2105621 |
Statements
Cycle lengths and chromatic number of graphs (English)
0 references
1 October 2004
0 references
Let \(r(G)\) and \(s(G)\) be the number of odd and even cycle lengths in a graph \(G,\) respectively. It is shown that for each graph \(G\) its chromatic number satisfies \(\chi (G)\leq \min \{2r(G)+2,2s(G)+3\}.\)
0 references
graph
0 references
chromatic number
0 references
cycle length
0 references
0.9435083
0 references
0.9293046
0 references
0.92743945
0 references
0.9270781
0 references
0.92237884
0 references
0.92070127
0 references
0 references
0.91809165
0 references
0 references
0.9175027
0 references
