A Certifying Algorithm for 3-Colorability of P 5-Free Graphs (Q3652246): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_61 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1866795302 / rank | |||
Normal rank | |||
Latest revision as of 23:24, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Certifying Algorithm for 3-Colorability of P 5-Free Graphs |
scientific article |
Statements
A Certifying Algorithm for 3-Colorability of P 5-Free Graphs (English)
0 references
17 December 2009
0 references
algorithm
0 references
\(P_5\)-free graph
0 references
3-colorabilty
0 references
