A bound on the chromatic number using the longest odd cycle length (Q3437002): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q114236190 / 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.1002/jgt.20209 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4234953542 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4871748 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:58, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bound on the chromatic number using the longest odd cycle length |
scientific article |
Statements
A bound on the chromatic number using the longest odd cycle length (English)
0 references
11 May 2007
0 references
graph coloring
0 references
chromatic number
0 references
odd cycles
0 references
