Cycle lengths and chromatic number of graphs (Q1883263): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q215558 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Peter Horák / rank | |||
Normal rank | |||
Revision as of 03:09, 11 February 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
