@ThomasKlimpel saw that one. youre joking? "The conjectures in this paper are correct for all graphs of size no larger than 5 and all graphs we have encountered."

@vzn No, I am not joking. I guess it is just a typo, and they meant: "The conjecture 2.9 is correct for all graphs of size no larger than ..." Even without that conjecture, they still claim a significantly improved time bound, similar to the time bound from Wenxue Du's paper (which I also haven't reviewed yet). And since it has only 14 pages, chances are high that I will read and then review it much earlier than Wenxue Du's paper.