Solving Hard Computational Problems Efficiently: Asymptotic Parametric Complexity 3-Coloring Algorithm
Figure 5
Results for 4-regular planar graphs.
Runtime analysis over random 4-regular planar graphs between 100 and 1000 vertices. Plot (a) shows the running times as a function of the number of vertices for both kinds of instance types. Plot (b) shows the proportion of 3-colorable and non-3-colorable graphs over the total number of graphs per number of vertices.