Advertisement
Browse Subject Areas
?

Click through the PLOS taxonomy to find articles in your field.

For more information about PLOS Subject Areas, click here.

< Back to Article

Solving Hard Computational Problems Efficiently: Asymptotic Parametric Complexity 3-Coloring Algorithm

Figure 1

Specially named graphs used in the article.

(A) Complete graph . (B) Complete 3-partite graph . (C) Tadpole graph , which imposes a binary constraint on 3-coloring: either or . (D) Path of length two . (E) graph that imposes a binary constraint on 3-coloring: either or .

Figure 1

doi: https://doi.org/10.1371/journal.pone.0053437.g001