An \(O(n^2)\) algorithm to color Meyniel graphs (Q5937923): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/dm/RousselR01, #quickstatements; #temporary_batch_1731530891435 |
||
| (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.1016/s0012-365x(00)00264-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058694911 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/dm/RousselR01 / rank | |||
Normal rank | |||
Latest revision as of 22:40, 13 November 2024
scientific article; zbMATH DE number 1621232
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n^2)\) algorithm to color Meyniel graphs |
scientific article; zbMATH DE number 1621232 |
Statements
An \(O(n^2)\) algorithm to color Meyniel graphs (English)
0 references
23 October 2001
0 references
perfect graphs
0 references
Meyniel graphs
0 references
coloring
0 references
greedy algorithm
0 references
