A certifying algorithm for 3-colorability of \(P _{5}\)-free graphs (Q3652246)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5649412
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A certifying algorithm for 3-colorability of \(P _{5}\)-free graphs |
scientific article; zbMATH DE number 5649412 |
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
0.8615925312042236
0 references
0.8551576137542725
0 references
0.8332235813140869
0 references
0.8175719380378723
0 references
0.8173581957817078
0 references
