A Certifying Algorithm for 3-Colorability of P 5-Free Graphs (Q3652246): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 13:07, 5 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