Cycle lengths and chromatic number of graphs (Q1883263): 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.1016/j.disc.2003.11.055 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2122560436 / rank | |||
Normal rank | |||
Revision as of 21:08, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cycle lengths and chromatic number of graphs |
scientific article |
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
