On Schmerl's effective version of Brooks' theorem (Q1065017): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (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.1016/0095-8956(84)90041-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2070194138 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Effective Version of Brooks' Theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Brooks' theorem and some related results. / rank | |||
Normal rank | |||
Latest revision as of 19:09, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Schmerl's effective version of Brooks' theorem |
scientific article |
Statements
On Schmerl's effective version of Brooks' theorem (English)
0 references
1984
0 references
highly recursive graph
0 references
Brooks' theorem
0 references
recursive k-colouring
0 references
