Colouring graphs when the number of colours is nearly the maximum degree (Q5176002): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/380752.380840 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968496968 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A constant-factor approximation algorithm for the <i>k</i> -median problem (extended abstract) / rank | |||
Normal rank | |||
Revision as of 18:04, 9 July 2024
scientific article; zbMATH DE number 6409743
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Colouring graphs when the number of colours is nearly the maximum degree |
scientific article; zbMATH DE number 6409743 |
Statements
Colouring graphs when the number of colours is nearly the maximum degree (English)
0 references
27 February 2015
0 references
graph colouring
0 references
probabilistic methods
0 references
