An \(O(n^2)\) algorithm to color Meyniel graphs (Q5937923): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56430116, #quickstatements; #temporary_batch_1704697335568 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:42, 30 January 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
