On the chromatic number of pentagon-free graphs of large minimum degree (Q2460625): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q56926662, #quickstatements; #temporary_batch_1711565664090 |
||
(2 intermediate revisions by 2 users not shown) | |||
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.1007/s00493-007-0054-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4252715293 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q56926662 / rank | |||
Normal rank |
Latest revision as of 22:04, 27 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the chromatic number of pentagon-free graphs of large minimum degree |
scientific article |
Statements
On the chromatic number of pentagon-free graphs of large minimum degree (English)
0 references
12 November 2007
0 references
chromatic number
0 references
pentagon-free graphs
0 references