Cycle lengths and chromatic number of graphs (Q1883263): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (6 intermediate revisions by 5 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2003.11.055 / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Peter Horák / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Peter Horák / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3491635 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graphs with \(k\) odd cycle lengths / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3433915 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Colouring Graphs with Prescribed Induced Cycle Lengths / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2003.11.055 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:31, 16 December 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
